Estimating Renyi Entropy of Discrete Distributions
From MaRDI portal
Abstract: It was recently shown that estimating the Shannon entropy of a discrete -symbol distribution requires samples, a number that grows near-linearly in the support size. In many applications can be replaced by the more general R'enyi entropy of order , . We determine the number of samples needed to estimate for all , showing that requires a super-linear, roughly samples, noninteger requires a near-linear samples, but, perhaps surprisingly, integer requires only samples. Furthermore, developing on a recently established connection between polynomial approximation and estimation of additive functions of the form , we reduce the sample complexity for noninteger values of by a factor of compared to the empirical estimator. The estimators achieving these bounds are simple and run in time linear in the number of samples. Our lower bounds provide explicit constructions of distributions with different R'enyi entropies that are hard to distinguish.
Cited in
(12)- Statistical estimation of the entropy of discrete random variables with a large number of outcomes
- Estimation of Rényi entropy for lifetime uncertainty
- Asymptotic Properties of the Plug-in Estimator of the Discrete Entropy Under Dependence
- Correcting convexity bias in function and functional estimate
- Rényi's residual entropy: a quantile approach
- Concentration of the collision estimator
- Properties of Shannon and Rényi entropies of the Poisson distribution as the functions of intensity parameter
- Threshold selection using Rényi's entropy
- Time-efficient quantum entropy estimator via samplizer
- scientific article; zbMATH DE number 7467644 (Why is no real title available?)
- Range (Rényi) entropy queries and partitioning
- Renyi entropy estimation revisited
This page was built for publication: Estimating Renyi Entropy of Discrete Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979075)