English

Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators

Statistics Theory 2016-08-23 v1 Information Theory math.IT Machine Learning Statistics Theory

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 kk \to \infty as the sample size nn \to \infty) into the functional of interest, the estimators we consider fix k and perform a bias correction. This is more efficient computationally, and, as we show in certain cases, statistically, leading to faster convergence rates. Our framework unifies several previous estimators, for most of which ours are the first finite sample guarantees.

Keywords

Cite

@article{arxiv.1606.01554,
  title  = {Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators},
  author = {Shashank Singh and Barnabás Póczos},
  journal= {arXiv preprint arXiv:1606.01554},
  year   = {2016}
}

Comments

16 pages, 0 figures

R2 v1 2026-06-22T14:18:11.383Z