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\to \infty$ as the sample size $n\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.

16 pages, 0 figures

References in corpus (7)

• Information theory in molecular biology
• Information Theoretical Estimators Toolbox
• Ensemble estimation of multivariate f-divergence
• Undercomplete Blind Subspace Deconvolution
• Pruning nearest neighbor cluster trees
• Exponential Concentration of a Density Functional Estimator
• Ensemble estimators for multivariate entropy estimation