Asymptotic behaviour of binned kernel density estimators for locally non-stationary random fields

We investigate the asymptotic behaviour of binned kernel density estimators for dependent and locally non-stationary random fields converging to stationary random fields. We focus on the study of the bias and the asymptotic normality of the estimators. A simulation experiment conducted shows that both the kernel density estimator and the binned kernel density estimator have the same behavior and both estimate accurately the true density when the number of fields increases. We apply our results to the 2002 incidence rates of tuberculosis in the departments of France.     

Large sample behavior of the Bernstein copula estimator

Bernstein polynomial estimators have been used as smooth estimators for density functions and distribution functions. The idea of using them for copula estimation has been given in Sancetta and Satchell (2004). In the present paper we study the asymptotic properties of this estimator: almost sure consistency rates and asymptotic normality. We also obtain explicit expressions for the asymptotic bias and asymptotic variance and show the improvement of the asymptotic mean squared error compared to that of the classical empirical copula estimator. A small simulation study illustrates this superior behavior in small samples.     

Shape Constrained Non‐parametric Estimators of the Baseline Distribution in Cox Proportional Hazards Model

Abstract. We investigate non‐parametric estimation of a monotone baseline hazard and a decreasing baseline density within the Cox model. Two estimators of a non‐decreasing baseline hazard function are proposed. We derive the non‐parametric maximum likelihood estimator and consider a Grenander type estimator, defined as the left‐hand slope of the greatest convex minorant of the Breslow estimator. We demonstrate that the two estimators are strongly consistent and asymptotically equivalent and derive their common limit distribution at a fixed point. Both estimators of a non‐increasing baseline hazard and their asymptotic properties are obtained in a similar manner. Furthermore, we introduce a Grenander type estimator for a non‐increasing baseline density, defined as the left‐hand slope of the least concave majorant of an estimator of the baseline cumulative distribution function, derived from the Breslow estimator. We show that this estimator is strongly consistent and derive its asymptotic distribution at a fixed point.     

Local Smoothing Using the Bootstrap

We consider the problem of data-based choice of the bandwidth of a kernel density estimator, with an aim to estimate the density optimally at a given design point. The existing local bandwidth selectors seem to be quite sensitive to the underlying density and location of the design point. For instance, some bandwidth selectors perform poorly while estimating a density, with bounded support, at the median. Others struggle to estimate a density in the tail region or at the trough between the two modes of a multimodal density. We propose a scale invariant bandwidth selection method such that the resulting density estimator performs reliably irrespective of the density or the design point. We choose bandwidth by minimizing a bootstrap estimate of the mean squared error (MSE) of a density estimator. Our bootstrap MSE estimator is different in the sense that we estimate the variance and squared bias components separately. We provide insight into the asymptotic accuracy of the proposed density estimator.     

Varying kernel marginal density estimator for a positive time series

This paper analyses the large sample behaviour of a varying kernel density estimator of the marginal density of a non-negative stationary and ergodic time series that is also strongly mixing. In particular we obtain an approximation for bias, mean square error and establish asymptotic normality of this density estimator. We also derive an almost sure uniform consistency rate over bounded intervals of this estimator. A finite sample simulation shows some superiority of the proposed density estimator over the one based on a symmetric kernel.     

Uniformly adaptive estimation for models with arma errors

A semiparametric estimator based on an unknown density isuniformly adaptive if the expected loss of the estimator converges to the asymptotic expected loss of the maximum liklihood estimator based on teh true density (MLE), and if convergence does not depend on either the parameter values or the form of the unknown density. Without uniform adaptivity, the asymptotic expected loss of the MLE need not approximate the expected loss of a semiparametric estimator for any finite sample I show that a two step semiparametric estimator is uniformly adaptive for the parameters of nonlinear regression models with autoregressive moving average errors.     

The Minimum Density Power Divergence Estimation for the Lognormal Density

In this article, we implement the minimum density power divergence estimation for estimating the parameters of the lognormal density. We compare the minimum density power divergence estimator (MDPDE) and the maximum likelihood estimator (MLE) in terms of robustness and asymptotic distribution. The simulations and an example indicate that the MDPDE is less biased than MLE and is as good as MLE in terms of the mean square error under various distributional situations.     

Uniformly adaptive estimation for models with arma errors

A semiparametric estimator based on an unknown density isuniformly adaptive if the expected loss of the estimator converges to the asymptotic expected loss of the maximum liklihood estimator based on teh true density (MLE), and if convergence does not depend on either the parameter values or the form of the unknown density. Without uniform adaptivity, the asymptotic expected loss of the MLE need not approximate the expected loss of a semiparametric estimator for any finite sample I show that a two step semiparametric estimator is uniformly adaptive for the parameters of nonlinear regression models with autoregressive moving average errors.     

Bernstein conditional density estimation with application to conditional distribution and regression functions

In this paper we propose a smooth nonparametric estimation for the conditional probability density function based on a Bernstein polynomial representation. Our estimator can be written as a finite mixture of beta densities with data-driven weights. Using the Bernstein estimator of the conditional density function, we derive new estimators for the distribution function and conditional mean. We establish the asymptotic properties of the proposed estimators, by proving their asymptotic normality and by providing their asymptotic bias and variance. Simulation results suggest that the proposed estimators can outperform the Nadaraya–Watson estimator and, in some specific setups, the local linear kernel estimators. Finally, we use our estimators for modeling the income in Italy, conditional on year from 1951 to 1998, and have another look at the well known Old Faithful Geyser data.     

Optimal and Robust Designs for Estimating the Concentration Curve and the AUC

The problem of interest is to estimate the concentration curve and the area under the curve (AUC) by estimating the parameters of a linear regression model with an autocorrelated error process. We introduce a simple linear unbiased estimator of the concentration curve and the AUC. We show that this estimator constructed from a sampling design generated by an appropriate density is asymptotically optimal in the sense that it has exactly the same asymptotic performance as the best linear unbiased estimator. Moreover, we prove that the optimal design is robust with respect to a minimax criterion. When repeated observations are available, this estimator is consistent and has an asymptotic normal distribution. Finally, a simulated annealing algorithm is applied to a pharmacokinetic model with correlated errors.     

Integrated Square Error Asymptotics for Supersmooth Deconvolution

Abstract.  We derive the asymptotic distribution of the integrated square error of a deconvolution kernel density estimator in supersmooth deconvolution problems. Surprisingly, in contrast to direct density estimation as well as ordinary smooth deconvolution density estimation, the asymptotic distribution is no longer a normal distribution but is given by a normalized chi-squared distribution with 2 d.f. A simulation study shows that the speed of convergence to the asymptotic law is reasonably fast.     

A Convolution Estimator for the Density of Nonlinear Regression Observations

Abstract. The problem of estimating an unknown density function has been widely studied. In this article, we present a convolution estimator for the density of the responses in a nonlinear heterogenous regression model. The rate of convergence for the mean square error of the convolution estimator is of order n ^?1 under certain regularity conditions. This is faster than the rate for the kernel density method. We derive explicit expressions for the asymptotic variance and the bias of the new estimator, and further a data‐driven bandwidth selector is proposed. We conduct simulation experiments to check the finite sample properties, and the convolution estimator performs substantially better than the kernel density estimator for well‐behaved noise densities.     

Large Deviations Limit Theorems for the Kernel Density Estimator

We establish pointwise and uniform large deviations limit theorems of Chernoff-type for the non-parametric kernel density estimator based on a sequence of independent and identically distributed random variables. The limits are well-identified and depend upon the underlying kernel and density function. We derive then some implications of our results in the study of asymptotic efficiency of the goodness-of-fit test based on the maximal deviation of the kernel density estimator as well as the inaccuracy rate of this estimate     

Wavelet estimation of density for censored data with censoring indicator missing at random

In this paper, we define the nonlinear wavelet estimator of density for the right censoring model with the censoring indicator missing at random (MAR), and develop its asymptotic expression for mean integrated squared error (MISE). Unlike for kernel estimator, the MISE expression of the estimator is not affected by the presence of discontinuities in the curve. Meanwhile, asymptotic normality of the estimator is established. The proposed estimator can reduce to the estimator defined by Li [Non-linear wavelet-based density estimators under random censorship. J Statist Plann Inference. 2003;117(1):35–58] when the censoring indicator MAR does not occur and a bandwidth in non-parametric estimation is close to zero. Also, we define another two nonlinear wavelet estimators of the density. A simulation is done to show the performance of the three proposed estimators.     

Root n consistent and optimal density estimators for moving average processes

Abstract.  The marginal density of a first order moving average process can be written as a convolution of two innovation densities. Saavedra & Cao [Can. J. Statist. (2000), 28, 799] propose to estimate the marginal density by plugging in kernel density estimators for the innovation densities, based on estimated innovations. They obtain that for an appropriate choice of bandwidth the variance of their estimator decreases at the rate 1/ n . Their estimator can be interpreted as a specific U -statistic. We suggest a slightly simplified U -statistic as estimator of the marginal density, prove that it is asymptotically normal at the same rate, and describe the asymptotic variance explicitly. We show that the estimator is asymptotically efficient if no structural assumptions are made on the innovation density. For innovation densities known to have mean zero or to be symmetric, we describe improvements of our estimator which are again asymptotically efficient.     

Asymptotic Distributions of Innovation Density Estimators in Linear Processes

In this article, we demonstrate that at a fixed point, the asymptotic distribution of the innovation density estimator is normal for stationary linear process. Also, we show that the asymptotic distribution of the global measure of the deviation of the density estimator from the expectation of the kernel innovation density (based on the true innovations) is the same as that in the case when we can observe the true innovations.     

Wavelet-Based Density Estimation in a Heteroscedastic Convolution Model

We consider a heteroscedastic convolution density model under the “ordinary smooth assumption.” We introduce a new adaptive wavelet estimator based on term-by-term hard thresholding rule. Its asymptotic properties are explored via the minimax approach under the mean integrated squared error over Besov balls. We prove that our estimator attains near optimal rates of convergence (lower bounds are determined). Simulation results are reported to support our theoretical findings.     

On the Estimation of the Density of a Directional Data Stream

Many directional data such as wind directions can be collected extremely easily so that experiments typically yield a huge number of data points that are sequentially collected. To deal with such big data, the traditional nonparametric techniques rapidly require a lot of time to be computed and therefore become useless in practice if real time or online forecasts are expected. In this paper, we propose a recursive kernel density estimator for directional data which (i) can be updated extremely easily when a new set of observations is available and (ii) keeps asymptotically the nice features of the traditional kernel density estimator. Our methodology is based on Robbins–Monro stochastic approximations ideas. We show that our estimator outperforms the traditional techniques in terms of computational time while being extremely competitive in terms of efficiency with respect to its competitors in the sequential context considered here. We obtain expressions for its asymptotic bias and variance together with an almost sure convergence rate and an asymptotic normality result. Our technique is illustrated on a wind dataset collected in Spain. A Monte‐Carlo study confirms the nice properties of our recursive estimator with respect to its non‐recursive counterpart.     

Asymptotic properties of the kernel mode estimator under twice censorship model

In this article, we study the asymptotic properties of the kernel estimator of the mode and density function when the data are twice censored. More specifically, we first establish a strong uniform consistency over a compact set with a rate of the kernel density estimator and then we give the consistency with rate and asymptotic normality for the kernel mode estimator. An application to confidence bands is given.     

Orthogonal series density estimation for complex surveys

We propose an orthogonal series density estimator for complex surveys, where samples are neither independent nor identically distributed. The proposed estimator is proved to be design-unbiased and asymptotically design-consistent. The asymptotic normality is proved under both design and combined spaces. Two data driven estimators are proposed based on the proposed oracle estimator. We show the efficiency of the proposed estimators in simulation studies. A real survey data example is provided for an illustration.