Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Consider the problem of estimating the Shannon entropy of a distribution over k elements from n independent samples. We show that the minimax mean-square error is within the universal multiplicative constant factors of (k/n log k)2t log2k/n if n exceeds a constant factor of (k/log k); otherwise, there exists no consistent estimator. This refines the recent result of Valiant and Valiant that the minimal sample size for consistent entropy estimation scales according to Θ(k/log k). The apparatus of the best polynomial approximation plays a key role in both the construction of optimal estimators and, by a duality argument, the minimax lower bound.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reliability of spike timing in neocortical neurons
Mainen, Z. F., & Sejnowski, T. J. (1995) · Science · doi:10.1126/science.7770778 · Cited by 1,950
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442 · cited 3×
“For (12) we need to choose a pair of priors, which, in this case, are distributions on the probability simplex M k , is to ensure the entropy values are separated.”
BackgroundMethodInfluential
Cited by
O'Donnell, R., & Wright, J. (2016) · Proceedings of the forty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/2897518.2897544 · Cited by 181
“true von Neumann entropy with high probability when n = O(d2/ǫ+ log(d)2/ǫ2). This gives an expression similar to both the bias and the mean absolute error of the classical empirical entropy estimator [WY16]. 1.7 Organization Section 2 contains the preliminaries, Section 3 contains the proof of Theorem 1.13, Section 4…”
InfluentialMinimax Rates of Estimating Approximate Differential Privacy
Liu, X., & Oh, S. (2019) · arXiv · doi:10.48550/arxiv.1905.10335 · Cited by 4
Metadata
- Authors
- Wu, Y., & Yang, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-06
- Volume
- 62
- Issue
- 6
- Pages
- 3702-3720
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2963608890
- Cited by
- 173
- References
- 2
- FWCI
- 24.99
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.