On optimal data-based bandwidth selection in kernel density estimation
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The result is a bandwidth selector with the, by nonparametric standards, extremely fast asymptotic rate of convergence of n−½ where n → ∞ denotes sample size.
Abstract
A bandwidth selection method is proposed for kernel density estimation. This is based on the straightforward idea of plugging estimates into the usual asymptotic representation for the optimal bandwidth, but with two important modifications. The result is a bandwidth selector with the, by nonparametric standards, extremely fast asymptotic rate of convergence of n−½ where n ↑ ∞ denotes sample size. Comparison is given to other bandwidth selection methods, and small sample impact is investigated.