2016
NeurIPS
NeurIPS 2016
Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators
Abstract
We provide finite-sample analysis of a general framework for using k-nearest neighbor statistics to estimate functionals of a nonparametric continuous probability density, including entropies and divergences. Rather than plugging a consistent density estimate (which requires k → ∞ as the sample size n → ∞) into the functional of interest, the estimators we consider fix k and perform a bias correction. This can be more efficient computationally, and, as we show, statistically, leading to faster convergence rates. Our framework unifies several previous estimators, for most of which ours are the first finite sample guarantees.
🌉
Interdisciplinary Bridge
- Artificial Intelligence and Mathematics & Optimization
📈
Trend Setter
- Density Estimation
🧭
Keyword Pioneer
- finite-sample guarantee
🐣
Hot Topic Early Bird
- k-nearest neighbor
Authors
Topics
Machine Learning > Optimization & Theory > Statistical Learning
Mathematics & Optimization > Mathematics > Information Theory
Mathematics & Optimization > Mathematics > Statistics
Mathematics & Optimization > Statistics
Machine Learning > Optimization & Theory > Sample Complexity
Machine Learning > Core Methods > Density Estimation
Machine Learning > Core Methods > Estimation