Ensemble estimators for multivariate entropy estimation
arXiv:1203.5829
Abstract
The problem of estimation of density functionals like entropy and mutual information has received much attention in the statistics and information theory communities. A large class of estimators of functionals of the probability density suffer from the curse of dimensionality, wherein the mean squared error (MSE) decays increasingly slowly as a function of the sample size as the dimension of the samples increases. In particular, the rate is often glacially slow of order , where is a rate parameter. Examples of such estimators include kernel density estimators, -nearest neighbor (-NN) density estimators, -NN entropy estimators, intrinsic dimension estimators and other examples. In this paper, we propose a weighted affine combination of an ensemble of such estimators, where optimal weights can be chosen such that the weighted estimator converges at a much faster dimension invariant rate of . Furthermore, we show that these optimal weights can be determined by solving a convex optimization problem which can be performed offline and does not require training data. We illustrate the superior performance of our weighted estimator for two important applications: (i) estimating the Panter-Dite distortion-rate factor and (ii) estimating the Shannon entropy for testing the probability distribution of a random sample.
version 3: correction of minor typos from version 2
References in corpus (1)
Cited by in corpus (5)
- Estimating Mutual Information for Discrete-Continuous Mixtures
- Analysis of k-Nearest Neighbor Distances with Application to Entropy Estimation
- Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators
- Divergence Measures Estimation and Its Asymptotic Normality Theory Using Wavelets Empirical Processes
- Divergence measures estimation and its asymptotic normality theory in the discrete case