Generalized LRS Estimator for Min-entropy Estimation
Jiheon Woo, Chanhee Yoo, Young-Sik Kim, Yuval Cassuto, and Yongjune, Kim

TL;DR
This paper introduces a generalized LRS estimator that accurately estimates min-entropy for non-IID sources by translating collision entropy and adopting higher-order Rényi entropy, improving estimation stability and accuracy.
Contribution
It proposes a novel generalized LRS estimator that overcomes overestimation issues and reduces variance by using Rényi entropy of higher order.
Findings
Significantly improves min-entropy estimation accuracy.
Reduces variance of estimates with higher-order Rényi entropy.
Provides a stable and effective alternative to existing LRS estimators.
Abstract
The min-entropy is a widely used metric to quantify the randomness of generated random numbers, which measures the difficulty of guessing the most likely output. It is difficult to accurately estimate the min-entropy of a non-independent and identically distributed (non-IID) source. Hence, NIST Special Publication (SP) 800-90B adopts ten different min-entropy estimators and then conservatively selects the minimum value among ten min-entropy estimates. Among these estimators, the longest repeated substring (LRS) estimator estimates the collision entropy instead of the min-entropy by counting the number of repeated substrings. Since the collision entropy is an upper bound on the min-entropy, the LRS estimator inherently provides \emph{overestimated} outputs. In this paper, we propose two techniques to estimate the min-entropy of a non-IID source accurately. The first technique resolves…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpeech Recognition and Synthesis · Music and Audio Processing · Algorithms and Data Compression
