Density estimation using asymmetric kernels and Bayes bandwidths with censored data

We propose a modification to the regular kernel density estimation method that use asymmetric kernels to circumvent the spill over problem for densities with positive support. First a pivoting method is introduced for placement of the data relative to the kernel function. This yields a strongly consistent density estimator that integrates to one for each fixed bandwidth in contrast to most density estimators based on asymmetric kernels proposed in the literature. Then a data-driven Bayesian local bandwidth selection method is presented and lognormal, gamma, Weibull and inverse Gaussian kernels are discussed as useful special cases. Simulation results and a real-data example illustrate the advantages of the new methodology.     

ERROR VARIANCE ESTIMATION FOR THE SINGLE‐INDEX MODEL

Single‐index models provide one way of reducing the dimension in regression analysis. The statistical literature has focused mainly on estimating the index coefficients, the mean function, and their asymptotic properties. For accurate statistical inference it is equally important to estimate the error variance of these models. We examine two estimators of the error variance in a single‐index model and compare them with a few competing estimators with respect to their corresponding asymptotic properties. Using a simulation study, we evaluate the finite‐sample performance of our estimators against their competitors.     

Smooth Estimation of the Reliability Function

Problems with censored data arise quite frequently in reliability applications. Estimation of the reliability function is usually of concern. Reliability function estimators proposed by Kaplan and Meier (1958), Breslow (1972), are generally used when dealing with censored data. These estimators have the known properties of being asymptotically unbiased, uniformly strongly consistent, and weakly convergent to the same Gaussian process, when properly normalized. We study the properties of the smoothed Kaplan-Meier estimator with a suitable kernel function in this paper. The smooth estimator is compared with the Kaplan-Meier and Breslow estimators for large sample sizes giving an exact expression for an appropriately normalized difference of the mean square error (MSE) of the two estimators. This quantifies the deficiency of the Kaplan-Meier estimator in comparison to the smoothed version. We also obtain a non-asymptotic bound on an expected ₁-type error under weak conditions. Some simulations are carried out to examine the performance of the suggested method.     

A new discrete distrlbution,with applications to survival,dispersal and dispersion

We describe a new discrete probability distribution with several useful properties for the analysis and modelling of survival processes and dispersion. First, the model can be used to describe survival processes with monotonically decreasing, constant, or increasing hazard functions, simply by tuning one parameter. Also, the model can describe counts that are overdispersed (contagious) or underdispersed, since the variance can exceed, equal, or be less than the mean. All of these properties are demonstrated both theoretically and with ecological examples, using ad-hoc parameter estimation techniques. Finally, the equations are tractable compared with, say, the negative binomial, and easily incorporated into larger models.     

A Test of Equality of Regression Curves Using Gâteaux Scores

This paper considers a test of equality of regression curves using a Gâteaux score statistic constructed through the derivative of the likelihood function. Judicious choices of the scores allow the proposed procedure to be generalized so that it can be used even with some long-tailed error distributions. The paper examines asymptotic properties and presents some numerical results.     

Adaptive penalized quantile regression for high dimensional data

We propose a new adaptive L₁ penalized quantile regression estimator for high-dimensional sparse regression models with heterogeneous error sequences. We show that under weaker conditions compared with alternative procedures, the adaptive L₁ quantile regression selects the true underlying model with probability converging to one, and the unique estimates of nonzero coefficients it provides have the same asymptotic normal distribution as the quantile estimator which uses only the covariates with non-zero impact on the response. Thus, the adaptive L₁ quantile regression enjoys oracle properties. We propose a completely data driven choice of the penalty level _λn${\lambda }_n$, which ensures good performance of the adaptive L₁ quantile regression. Extensive Monte Carlo simulation studies have been conducted to demonstrate the finite sample performance of the proposed method.     

Flexible semi-parametric regression of state occupational probabilities in a multistate model with right-censored data

Inference for the state occupation probabilities, given a set of baseline covariates, is an important problem in survival analysis and time to event multistate data. We introduce an inverse censoring probability re-weighted semi-parametric single index model based approach to estimate conditional state occupation probabilities of a given individual in a multistate model under right-censoring. Besides obtaining a temporal regression function, we also test the potential time varying effect of a baseline covariate on future state occupation. We show that the proposed technique has desirable finite sample performances and its performance is competitive when compared with three other existing approaches. We illustrate the proposed methodology using two different data sets. First, we re-examine a well-known data set dealing with leukemia patients undergoing bone marrow transplant with various state transitions. Our second illustration is based on data from a study involving functional status of a set of spinal cord injured patients undergoing a rehabilitation program.     

Robust adaptive Lasso for variable selection

The adaptive least absolute shrinkage and selection operator (Lasso) and least absolute deviation (LAD)-Lasso are two attractive shrinkage methods for simultaneous variable selection and regression parameter estimation. While the adaptive Lasso is efficient for small magnitude errors, LAD-Lasso is robust against heavy-tailed errors and severe outliers. In this article, we consider a data-driven convex combination of these two modern procedures to produce a robust adaptive Lasso, which not only enjoys the oracle properties, but synthesizes the advantages of the adaptive Lasso and LAD-Lasso. It fully adapts to different error structures including the infinite variance case and automatically chooses the optimal weight to achieve both robustness and high efficiency. Extensive simulation studies demonstrate a good finite sample performance of the robust adaptive Lasso. Two data sets are analyzed to illustrate the practical use of the procedure.     

On the error term in bahadur's representation of an order statistic

Bahadur (1966) presented a representation of an order statistic, giving its asymptotic distribution and the rate of convergence, under weak assumptions on the density function of the parent distribution. In this paper we consider the mean(squared) deviation of the error term in Bahadur’s approximation of the q th sample quantile (q_n ). We derive a uniform bound on the mean (squared) deviation of q_n , not depending on the value of q. An application of the given result provides the corresponding result for a kernel type estimator of the q th quantile.