articleNeural ComputationMay 22, 2003Closed access

Estimation of Entropy and Mutual Information

New York University

Indexed incrossref

Abstract

We present some new results on the nonparametric estimation of entropy and mutual information. First, we use an exact local expansion of the entropy function to prove almost sure consistency and central limit theorems for three of the most commonly used discretized information estimators. The setup is related to Grenander's method of sieves and places no assumptions on the underlying probability measure generating the data. Second, we prove a converse to these consistency theorems, demonstrating that a misapplication of the most common estimation techniques leads to an arbitrarily poor estimate of the true information, even given unlimited data. This “inconsistency” theorem leads to an analytical approximation…

Citation impact

1,458
total citations
FWCI
21.25
Percentile
100%
References
63
Citations per year

Authors

1

Topics & keywords

Keywords
  • Estimator
  • Mathematics
  • Applied mathematics
  • Entropy (arrow of time)
  • Mutual information
  • Central limit theorem
  • Nonparametric statistics
  • Statistics
UN Sustainable Development Goals
  • No poverty
No related works found for this paper.