Quasi-universal bandwidth selection for kernel density estimators

Let f?_n, h denote the kernel density estimate based on a sample of size n drawn from an unknown density f. Using techniques from L₂ projection density estimators, the author shows how to construct a data-driven estimator f?_n, h which satisfies This paper is inspired by work of Stone (1984), Devroye and Lugosi (1996) and Birge and Massart (1997).     

On kernel estimators of density ratio

Let f(x) and g(x) denote two probability density functions and g(x)≠0. There are two ways to estimate the density ratio f(x)/g(x). One is to estimate f(x) and g(x) first and then the ratio, the other is to estimate f(x)/g(x) directly. In this paper, we derive asymptotic mean square errors and central limit theorems for both estimators.     

Data‐driven choice of the smoothing parametrization for kernel density estimators

There are several levels of sophistication when specifying the bandwidth matrix H to be used in a multivariate kernel density estimator, including H to be a positive multiple of the identity matrix, a diagonal matrix with positive elements or, in its most general form, a symmetric positive‐definite matrix. In this paper, the author proposes a data‐based method for choosing the smoothing parametrization to be used in the kernel density estimator. The procedure is fully illustrated by a simulation study and some real data examples. The Canadian Journal of Statistics © 2009 Statistical Society of Canada     

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.     

Pointwise and uniform convergence of multivariate kernel density estimators using random bandwidths

We obtain the rates of pointwise and uniform convergence of multivariate kernel density estimators using a random bandwidth vector obtained by some data-based algorithm. We are able to obtain faster rate for pointwise convergence. The uniform convergence rate is obtained under some moment condition on the marginal distribution. The rates are obtained under i.i.d. and strongly mixing type dependence assumptions.     

A hybrid bandwidth selection methodology for kernel density estimation

A bandwidth selection method that combines the concept of least-squares cross-validation and the plug-in approach is being introduced in connection with kernel density estimation. A simulation study reveals that this hybrid methodology outperforms some commonly used bandwidth selection rules. It is shown that the proposed approach can also be readily employed in the context of variable kernel density estimation. We conclude with two illustrative examples.     

Limiting bias-reduced Amoroso kernel density estimators for non-negative data

The Amoroso kernel density estimator (Igarashi and Kakizawa 2017 Igarashi, G., and Y. Kakizawa. 2017. Amoroso kernel density estimation for nonnegative data and its bias reduction. Department of Policy and Planning Sciences Discussion Paper Series No. 1345, University of Tsukuba. [Google Scholar]) for non-negative data is boundary-bias-free and has the mean integrated squared error (MISE) of order O(n^{? 4/5}), where n is the sample size. In this paper, we construct a linear combination of the Amoroso kernel density estimator and its derivative with respect to the smoothing parameter. Also, we propose a related multiplicative estimator. We show that the MISEs of these bias-reduced estimators achieve the convergence rates n^{? 8/9}, if the underlying density is four times continuously differentiable. We illustrate the finite sample performance of the proposed estimators, through the simulations.     

Central limit theorems of range-based estimators for diffusion models

Abstract

In this article, we consider non parametric range-based estimation procedure for diffusion processes and propose a instantaneous volatility estimator. Under some weak conditions, we certify that the proposed estimator has convergence in probability. Adding some necessary conditions, we prove a central limit theorem. By inference, we reach a conclusion that, with high frequency data in hand, the proposed estimator is more precise than those pure realized instantaneous volatility ones. Numerical simulation illustrates the finite sample properties of the proposed estimator.     

Improved reduced-bias tail index and quantile estimators

In this paper, we deal with bias reduction techniques for heavy tails, trying to improve mainly upon the performance of classical high quantile estimators. High quantiles depend strongly on the tail index γ$\gamma$, for which new classes of reduced-bias estimators have recently been introduced, where the second-order parameters in the bias are estimated at a level _k1$k_1$ of a larger order than the level k at which the tail index is estimated. Doing this, it was seen that the asymptotic variance of the new estimators could be kept equal to the one of the popular Hill estimators. In a similar way, we now introduce new classes of tail index and associated high quantile estimators, with an asymptotic mean squared error smaller than that of the classical ones for all k in a large class of heavy-tailed models. We derive their asymptotic distributional properties and compare them with those of alternative estimators. Next to that, an illustration of the finite sample behavior of the estimators is also provided through a Monte Carlo simulation study and the application to a set of real data in the field of insurance.     

Subsampling-extrapolation bandwidth selection in bivariate kernel density estimation

This paper focuses on bivariate kernel density estimation that bridges the gap between univariate and multivariate applications. We propose a subsampling-extrapolation bandwidth matrix selector that improves the reliability of the conventional cross-validation method. The proposed procedure combines a U-statistic expression of the mean integrated squared error and asymptotic theory, and can be used in both cases of diagonal bandwidth matrix and unconstrained bandwidth matrix. In the subsampling stage, one takes advantage of the reduced variability of estimating the bandwidth matrix at a smaller subsample size m (m < n); in the extrapolation stage, a simple linear extrapolation is used to remove the incurred bias. Simulation studies reveal that the proposed method reduces the variability of the cross-validation method by about 50% and achieves an expected integrated squared error that is up to 30% smaller than that of the benchmark cross-validation. It shows comparable or improved performance compared to other competitors across six distributions in terms of the expected integrated squared error. We prove that the components of the selected bivariate bandwidth matrix have an asymptotic multivariate normal distribution, and also present the relative rate of convergence of the proposed bandwidth selector.     

Semiparametric estimation for count data through weighted distributions

This paper is concerned with semiparametric discrete kernel estimators when the unknown count distribution can be considered to have a general weighted Poisson form. The estimator is constructed by multiplying the Poisson estimate with a nonparametric discrete kernel-type estimate of the Poisson weight function. Comparisons are then carried out with the ordinary discrete kernel probability mass function estimators. The Poisson weight function is thus a local multiplicative correction factor, and is considered as the uniform measure to detect departures from the equidispersed Poisson distribution. In this way, the effects of dispersion and zero-proportion with respect to the standard Poisson distribution are also minimized. This method of estimation is also applied to the weighted binomial form for the count distribution having a finite support. The proposed estimators, in addition to being simple, easy-to-implement and effective, also outperform the competing nonparametric and parametric estimators in finite-sample situations. Two examples illustrate this new semiparametric estimation.     

The convolution theorem for estimating linear functionals in indirect nonparametric regression models

Nonparametric regression—directly or indirectly observed—is one of the important statistical models. On one hand it contains two infinite dimensional parameters (the regression function and the error density), and on the other it is of rather simple structure. Therefore, it may serve as an interesting paradigm for illustrating or developing abstract statistical theory for non-Euclidean parameters. In this paper estimation of a linear functional of the indirectly observed regression function is considered, when a deterministic design is used. It should be noted that any Fourier coefficient of an expansion of the regression function in an orthonormal basis is such a functional. Because the design is deterministic the observables are independent but not identically distributed. Local asymptotic normality is established and applied to prove Hájek's convolution theorem for this functional. Pertinent references are Beran [1977. Robust location estimates. Ann. Statist. 5, 431–444] and McNeney and Wellner [2000. Application of convolution theorems in semiparametric models with non-i.i.d. data. J. Statist. Plann. Inference 91, 441–480]. For purposes explained above, however, the paper is kept self-contained and full proofs are provided.     

On the asymptotic normality of the L1- and L2-errors in histogram density estimation

The L₁ and L₂-errors of the histogram estimate of a density f from a sample X₁,X₂,…,Xn using a cubic partition are shown to be asymptotically normal without any unnecessary conditions imposed on the density f. The asymptotic variances are shown to depend on f only through the corresponding norm of f. From this follows the asymptotic null distribution of a goodness-of-fit test based on the total variation distance, introduced by Györfi and van der Meulen (1991). This note uses the idea of partial inversion for obtaining characteristic functions of conditional distributions, which goes back at least to Bartlett (1938).     

Diagnostic measures for kernel ridge regression on reproducing kernel Hilbert space

The aim of this paper is to define and develop diagnostic measures with respect to kernel ridge regression in a reproducing kernel Hilbert space (RKHS). To identify influential observations, we define a particular version of Cook’s distance for the kernel ridge regression model in RKHS, which is conceptually consistent with Cook’s distance in a classical regression model. Then, by using the perturbation formula for the regularized conditional expectation of the outcome in RKHS, we develop an approximate version of Cook”s distance in RKHS because the original definition requires intensive computations. Such an approximated Cook”s distance is represented in terms of basic building blocks such as residuals and leverages of the kernel ridge regression. The results of the simulation and real application demonstrate that our diagnostic measure successfully detects potentially influential observations on estimators in kernel ridge regression.     

Multivariate orthogonal series estimates for random design regression

In this paper a new multivariate regression estimate is introduced. It is based on ideas derived in the context of wavelet estimates and is constructed by hard thresholding of estimates of coefficients of a series expansion of the regression function. Multivariate functions constructed analogously to the classical Haar wavelets are used for the series expansion. These functions are orthogonal in _L2(_μn)$L_2({\mu }_n)$, where _μn${\mu }_n$ denotes the empirical design measure. The construction can be considered as designing adapted Haar wavelets.     

A Bayesian model for local smoothing in kernel density estimation

A new procedure is proposed for deriving variable bandwidths in univariate kernel density estimation, based upon likelihood cross-validation and an analysis of a Bayesian graphical model. The procedure admits bandwidth selection which is flexible in terms of the amount of smoothing required. In addition, the basic model can be extended to incorporate local smoothing of the density estimate. The method is shown to perform well in both theoretical and practical situations, and we compare our method with those of Abramson (The Annals of Statistics 10: 1217–1223) and Sain and Scott (Journal of the American Statistical Association 91: 1525–1534). In particular, we note that in certain cases, the Sain and Scott method performs poorly even with relatively large sample sizes.We compare various bandwidth selection methods using standard mean integrated square error criteria to assess the quality of the density estimates. We study situations where the underlying density is assumed both known and unknown, and note that in practice, our method performs well when sample sizes are small. In addition, we also apply the methods to real data, and again we believe our methods perform at least as well as existing methods.