A note on kernel density estimation at a parametric rate
J. E. Chac\'on, J. Montanero, A. G. Nogales

TL;DR
This paper characterizes kernels that achieve parametric convergence rates in kernel density estimation and proposes an asymptotic bandwidth selection method to optimize estimator performance.
Contribution
It provides a characterization of kernels that attain the parametric rate and introduces a bandwidth choice for consistent estimation at that rate.
Findings
Superkernel estimator outperforms traditional methods with proper bandwidth.
Asymptotic bandwidth selection achieves the $n^{-1}$ mean integrated squared error rate.
Theoretical characterization guides kernel choice for optimal density estimation.
Abstract
In the context of kernel density estimation, we give a characterization of the kernels for which the parametric mean integrated squared error rate may be obtained, where is the sample size. Also, for the cases where this rate is attainable, we give an asymptotic bandwidth choice that makes the kernel estimator consistent in mean integrated squared error at that rate and a numerical example showing the superior performance of the superkernel estimator when the bandwidth is properly chosen.
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.
Taxonomy
TopicsStatistical Methods and Inference · Mathematical Approximation and Integration · Control Systems and Identification
