Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
Optimal Rényi and Logarithmic Additive Functional Entropy Estimation
Arman Adibi, Piotr Krysta
We characterize the minimax sample complexity of estimating Rényi entropy from independent samples on an alphabet of size at most , when the known order may vary with .…
cs.IT2026
Tight Sample Bounds for Renyi and Min-Entropy Estimation
Arman Adibi, Piotr Krysta
Estimating entropy from samples is fundamental in information theory and property testing. Shannon entropy measures average uncertainty and can be estimated to constant additive ac…