Estimating Renyi Entropy of Discrete Distributions

From MaRDI portal




Abstract: It was recently shown that estimating the Shannon entropy H(mp) of a discrete k-symbol distribution mp requires Theta(k/logk) samples, a number that grows near-linearly in the support size. In many applications H(mp) can be replaced by the more general R'enyi entropy of order alpha, Halpha(mp). We determine the number of samples needed to estimate Halpha(mp) for all alpha, showing that alpha<1 requires a super-linear, roughly k1/alpha samples, noninteger alpha>1 requires a near-linear k samples, but, perhaps surprisingly, integer alpha>1 requires only Theta(k11/alpha) samples. Furthermore, developing on a recently established connection between polynomial approximation and estimation of additive functions of the form sumxf(mpx), we reduce the sample complexity for noninteger values of alpha by a factor of logk 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.












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)