Blessing of dimensionality in cross-validated bandwidth selection on the sphere
Jos\'e E. Chac\'on, Eduardo Garc\'ia-Portugu\'es, and Andrea Meil\'an-Vila

TL;DR
This paper demonstrates that in kernel density estimation on the sphere, the convergence rate of cross-validation bandwidth selection improves with higher dimensions, supporting its use over plug-in methods in large dimensions.
Contribution
It provides the first theoretical analysis of the asymptotic behavior of cross-validation bandwidth selection on the sphere, revealing a dimensionality-related blessing effect.
Findings
Convergence rate approaches parametric rate as dimension increases
Cross-validation outperforms plug-in methods beyond a certain dimension
Numerical experiments confirm theoretical convergence rates
Abstract
We study the asymptotic behavior of least-squares cross-validation bandwidth selection in kernel density estimation on the -dimensional hypersphere, . We show that the exact rate of convergence with respect to the optimal bandwidth minimizing the mean integrated squared error, shown to exist under mild non-uniformity conditions, is , thus approaching the parametric rate as grows. This ``blessing of dimensionality'' in bandwidth selection offers theoretical support for utilizing the conceptually simpler cross-validation selector over plug-in techniques for larger dimensions . We compare this result for bandwidth estimation on the -dimensional Euclidean space through explicit expressions for the asymptotic variance functionals. Numerical experiments corroborate the speed of this convergence in an array of scenarios and dimensions, precisely…
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 · Stochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods
