Asymptotic normality of the deconvolution kernel density estimator under the vanishing error variance
Shota Gugushvili, Bert van Es

TL;DR
This paper establishes the asymptotic normality of the deconvolution kernel density estimator when the error variance diminishes with sample size, providing theoretical insights and simulation evidence for different asymptotic regimes.
Contribution
It derives the asymptotic normality of the deconvolution kernel density estimator under vanishing error variance, extending existing results to new asymptotic scenarios.
Findings
Asymptotic normality holds under two different conditions relating $\sigma_n$ and $h_n$.
Simulations illustrate the theoretical results and show situations favoring models with decreasing $\sigma_n$.
Models with $\sigma_n o 0$ can outperform fixed $\sigma$ models in certain cases.
Abstract
Let be i.i.d. observations, where and the 's and 's are independent. Assume that the 's are unobservable and that they have the density and also that the 's have a known density Furthermore, let depend on and let as We consider the deconvolution problem, i.e. the problem of estimation of the density based on the sample A popular estimator of in this setting is the deconvolution kernel density estimator. We derive its asymptotic normality under two different assumptions on the relation between the sequence and the sequence of bandwidths We also consider several simulation examples which illustrate different types of asymptotics corresponding to the derived theoretical results and which show that there exist situations where models with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
