The Complexity of Estimating Rényi Entropy

DOI10.1137/1.9781611973730.124zbMath1373.62029OpenAlexW2950286539MaRDI QIDQ5363069

Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi, Jayadev Acharya

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.124

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Statistical aspects of information-theoretic topics (62B10)

Related Items (5)

Concentration of the collision estimator ⋮ Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint ⋮ Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies ⋮ Unnamed Item ⋮ Convexity and robustness of the Rényi entropy

This page was built for publication: The Complexity of Estimating Rényi Entropy