arXiv (All)
open access
Optimal Rényi and Logarithmic Additive Functional Entropy Estimation
We characterize the minimax sample complexity of estimating Rényi entropy from independent samples on an alphabet of size at most $k$, when the known order $α>1$ may vary with $k$. For every fixed additive accuracy $\varepsilon\in(0,1/2)$ and success probability $2/3$, we prove matching bounds with
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multiplicative comparisons of Rényi entropies for weighted Bernoulli sums#821562
- Mixed moments of arithmetic functions and Kloosterman sums#1234797
- A Finite-Blocklength Analysis for ORBGRAND#973084
- Convergence of Statistical Estimators via Mutual Information Bounds#1198800
- Horizontal moments of Kloosterman sums and a density version of sieves#1248010
Record · ID 1413240
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive