Efficient estimation in conditional single-index regression

Semiparametric single-index regression involves an unknown finite-dimensional parameter and an unknown (link) function. We consider estimation of the parameter via the pseudo-maximum likelihood method. For this purpose we estimate the conditional density of the response given a candidate index and maximize the obtained likelihood. We show that this technique of adaptation yields an asymptotically efficient estimator: it has minimal variance among all estimators.     

Likelihood-based kernel estimation in semiparametric errors-in-covariables models with validation data

We present methods to handle error-in-variables models. Kernel-based likelihood score estimating equation methods are developed for estimating conditional density parameters. In particular, a semiparametric likelihood method is proposed for sufficiently using the information in the data. The asymptotic distribution theory is derived. Small sample simulations and a real data set are used to illustrate the proposed estimation methods.     

Empirical likelihood inference for censored median regression model via nonparametric kernel estimation

An alternative to the accelerated failure time model is to regress the median of the failure time on the covariates. In the recent years, censored median regression models have been shown to be useful for analyzing a variety of censored survival data with the robustness property. Based on missing information principle, a semiparametric inference procedure for regression parameter has been developed when censoring variable depends on continuous covariate. In order to improve the low coverage accuracy of such procedure, we apply an empirical likelihood ratio method (EL) to the model and derive the limiting distributions of the estimated and adjusted empirical likelihood ratios for the vector of regression parameter. Two kinds of EL confidence regions for the unknown vector of regression parameters are obtained accordingly. We conduct an extensive simulation study to compare the performance of the proposed methods with that normal approximation based method. The simulation results suggest that the EL methods outperform the normal approximation based method in terms of coverage probability. Finally, we make some discussions about our methods.     

Non-parametric kernel regression for multinomial data

This paper presents a kernel smoothing method for multinomial regression. A class of estimators of the regression functions is constructed by minimizing a localized power-divergence measure. These estimators include the bandwidth and a single parameter originating in the power-divergence measure as smoothing parameters. An asymptotic theory for the estimators is developed and the bias-adjusted estimators are obtained. A data-based algorithm for selecting the smoothing parameters is also proposed. Simulation results reveal that the proposed algorithm works efficiently.     

Nonparametric regression function estimation with surrogate data and validation sampling

This paper develops estimation approaches for nonparametric regression analysis with surrogate data and validation sampling when response variables are measured with errors. Without assuming any error model structure between the true responses and the surrogate variables, a regression calibration kernel regression estimate is defined with the help of validation data. The proposed estimator is proved to be asymptotically normal and the convergence rate is also derived. A simulation study is conducted to compare the proposed estimators with the standard Nadaraya-Watson estimators with the true observations in the validation data set and the complete observations, respectively. The Nadaraya-Watson estimator with the complete observations can serve as a gold standard, even though it is practically unachievable because of the measurement errors.     

Tree-based multivariate regression and density estimation with right-censored data

We propose a unified strategy for estimator construction, selection, and performance assessment in the presence of censoring. This approach is entirely driven by the choice of a loss function for the full (uncensored) data structure and can be stated in terms of the following three main steps. (1) First, define the parameter of interest as the minimizer of the expected loss, or risk, for a full data loss function chosen to represent the desired measure of performance. Map the full data loss function into an observed (censored) data loss function having the same expected value and leading to an efficient estimator of this risk. (2) Next, construct candidate estimators based on the loss function for the observed data. (3) Then, apply cross-validation to estimate risk based on the observed data loss function and to select an optimal estimator among the candidates. A number of common estimation procedures follow this approach in the full data situation, but depart from it when faced with the obstacle of evaluating the loss function for censored observations. Here, we argue that one can, and should, also adhere to this estimation road map in censored data situations.Tree-based methods, where the candidate estimators in Step 2 are generated by recursive binary partitioning of a suitably defined covariate space, provide a striking example of the chasm between estimation procedures for full data and censored data (e.g., regression trees as in CART for uncensored data and adaptations to censored data). Common approaches for regression trees bypass the risk estimation problem for censored outcomes by altering the node splitting and tree pruning criteria in manners that are specific to right-censored data. This article describes an application of our unified methodology to tree-based estimation with censored data. The approach encompasses univariate outcome prediction, multivariate outcome prediction, and density estimation, simply by defining a suitable loss function for each of these problems. The proposed method for tree-based estimation with censoring is evaluated using a simulation study and the analysis of CGH copy number and survival data from breast cancer patients.     

Quantile regression for longitudinal data

The penalized least squares interpretation of the classical random effects estimator suggests a possible way forward for quantile regression models with a large number of “fixed effects”. The introduction of a large number of individual fixed effects can significantly inflate the variability of estimates of other covariate effects. Regularization, or shrinkage of these individual effects toward a common value can help to modify this inflation effect. A general approach to estimating quantile regression models for longitudinal data is proposed employing ?₁ regularization methods. Sparse linear algebra and interior point methods for solving large linear programs are essential computational tools.     

Wavelet estimation of conditional density with truncated, censored and dependent data

In this paper we define a new nonlinear wavelet-based estimator of conditional density function for a random left truncation and right censoring model. We provide an asymptotic expression for the mean integrated squared error (MISE) of the estimator. It is assumed that the lifetime observations form a stationary α-mixing sequence. Unlike for kernel estimators, the MISE expression of the wavelet-based estimators is not affected by the presence of discontinuities in the curves. Also, asymptotic normality of the estimator is established.     

Optimal global rate of convergence in nonparametric regression with left-truncated and right-censored data

In this paper we consider nonparametric regression with left-truncated and right-censored data. An estimator of the regression function is developed when censoring and truncation are independent of covariates and the response. The estimation is based on the product limit estimator of the response variable. Under certain conditions, the L₂ rate of convergence of the estimated regression function is obtained when tensor products of B-splines are used.     

Speed of convergence in nonparametric kernel estimation of a regression function and its derivatives

Summary The objective in nonparametric regression is to infer a functiong(x) and itspth order derivativesg ^(g)(x),p≧1 fixed, on the basis of a finite collection of pairs {x _i, g(x_i)+Z _i} _i=1 ⁿ , where the noise componentsZ _i satisfy certain modest assumptions and the domain pointsx _i are selected non-randomly. This paper exhibits a new class of kernel estimatesg _n ^(p) ,p≧0 fixed. The main theoretical results of this study are the rates of convergence obtained for mean square and strong consistency ofg _n ^(p) each of them being uniform on the (0,1).     

Strong convergence in nonparametric regression with truncated dependent data

In this paper we derive rates of uniform strong convergence for the kernel estimator of the regression function in a left-truncation model. It is assumed that the lifetime observations with multivariate covariates form a stationary α-mixing sequence. The estimation of the covariate’s density is considered as well. Under the assumption that the lifetime observations are bounded, we show that, by an appropriate choice of the bandwidth, both estimators of the covariate’s density and regression function attain the optimal strong convergence rate known from independent complete samples.     

A Berry-Esseen type bound in kernel density estimation for strong mixing censored samples

In this paper, we discuss the estimation of a density function based on censored data by the kernel smoothing method when the survival and the censoring times form a stationary α-mixing sequence. A Berry-Esseen type bound is derived for the kernel density estimator at a fixed point x. For practical purposes, a randomly weighted estimator of the density function is also constructed and investigated.     

Nonparametric variance function estimation with missing data

In this paper, a fixed design regression model where the errors follow a strictly stationary process is considered. In this model the conditional mean function and the conditional variance function are unknown curves. Correlated errors when observations are missing in the response variable are assumed. Four nonparametric estimators of the conditional variance function based on local polynomial fitting are proposed. Expressions of the asymptotic bias and variance of these estimators are obtained. A simulation study illustrates the behavior of the proposed estimators.     

Estimation in generalized linear models for functional data via penalized likelihood

We analyze in a regression setting the link between a scalar response and a functional predictor by means of a Functional Generalized Linear Model. We first give a theoretical framework and then discuss identifiability of the model. The functional coefficient of the model is estimated via penalized likelihood with spline approximation. The L² rate of convergence of this estimator is given under smoothness assumption on the functional coefficient. Heuristic arguments show how these rates may be improved for some particular frameworks.     

Nonparametric estimation for pure jump Lévy processes based on high frequency data

In this paper, we study nonparametric estimation of the Lévy density for pure jump Lévy processes. We consider n$n$ discrete time observations with step Δ$\Delta$. The asymptotic framework is: n$n$ tends to infinity, Δ=_Δn$\Delta ={\Delta }_n$ tends to zero while n_Δn$n{\Delta }_n$ tends to infinity. First, we use a Fourier approach (“frequency domain”): this allows us to construct an adaptive nonparametric estimator and to provide a bound for the global L²${\mathbb{L}}^2$-risk. Second, we use a direct approach (“time domain”) which allows us to construct an estimator on a given compact interval. We provide a bound for L²${\mathbb{L}}^2$-risk restricted to the compact interval. We discuss rates of convergence and give examples and simulation results for processes fitting in our framework.     

Estimation of a multivariate stochastic volatility density by kernel deconvolution

We consider a continuous time stochastic volatility model. The model contains a stationary volatility process. We aim to estimate the multivariate density of the finite-dimensional distributions of this process. We assume that we observe the process at discrete equidistant instants of time. The distance between two consecutive sampling times is assumed to tend to zero.A multivariate Fourier-type deconvolution kernel density estimator based on the logarithm of the squared processes is proposed to estimate the multivariate volatility density. An expansion of the bias and a bound on the variance are derived.     

Superefficient estimation of the marginals by exploiting knowledge on the copula

We consider the problem of estimating the marginals in the case where there is knowledge on the copula. If the copula is smooth, it is known that it is possible to improve on the empirical distribution functions: optimal estimators still have a rate of convergence n^−1/2, but a smaller asymptotic variance. In this paper we show that for non-smooth copulas it is sometimes possible to construct superefficient estimators of the marginals: we construct both a copula and, exploiting the information our copula provides, estimators of the marginals with the rate of convergence logn/n.     

An adaptive estimation of MAVE

Minimum average variance estimation (MAVE, Xia et al. (2002) [29]) is an effective dimension reduction method. It requires no strong probabilistic assumptions on the predictors, and can consistently estimate the central mean subspace. It is applicable to a wide range of models, including time series. However, the least squares criterion used in MAVE will lose its efficiency when the error is not normally distributed. In this article, we propose an adaptive MAVE which can be adaptive to different error distributions. We show that the proposed estimate has the same convergence rate as the original MAVE. An EM algorithm is proposed to implement the new adaptive MAVE. Using both simulation studies and a real data analysis, we demonstrate the superior finite sample performance of the proposed approach over the existing least squares based MAVE when the error distribution is non-normal and the comparable performance when the error is normal.     

On estimation of the L r norm of a regression function

f be observed with noise. In the present paper we study the problem of nonparametric estimation of certain nonsmooth functionals of f, specifically, L _r norms ||f|| _r of f. Known from the literature results on functional estimation deal mostly with two extreme cases: estimating a smooth (differentiable in L ₂ ) functional or estimating a singular functional like the value of f at certain point or the maximum of f. In the first case, the convergence rate typically is n ^−1/2, n being the number of observations. In the second case, the rate of convergence coincides with the one of estimating the function f itself in the corresponding norm. We show that the case of estimating ||f|| _r is in some sense intermediate between the above extremes. The optimal rate of convergence is worse than n ^−1/2 but is better than the rate of convergence of nonparametric estimates of f. The results depend on the value of r. For r even integer, the rate occurs to be n ^{−β/(2β+1−1/r)} where β is the degree of smoothness. If r is not an even integer, then the nonparametric rate n ^{−β/(2β+1)} can be improved, but only by a logarithmic in n factor. Received: 6 February 1996hinspaceairsp/Revised version: 10 June 1998