Extremizers of the expected missing mass under an entropy constraint
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
For a discrete probability distribution , the expected mass of symbols absent from independent samples is . For every positive integer and finite entropy budget , we prove that every -local maximizer under has at most two distinct positive coordinate values, and all but at most one positive coordinate are equal. This holds on finite and countably infinite alphabets and improves the four-size bound of Berend, Kontorovich, and Zagdanski (2017). On a countably infinite alphabet, we give an exact finite classification of all global maximizers: a unique one-light or uniform candidate is compared with an explicitly bounded family of one-heavy candidates, whose masses are uniquely specified by entropy equations. The one-light or uniform candidate is uniquely optimal for . For fixed , the optimal value satisfies \[ \frac{h}{B_t(h)}=\log t+\log\log t+2 +O_h\!\left(\frac{\log\log t}{\log t}\right). \] Every optimizer is eventually one-heavy, with equal light atoms of size . The two-size proof combines a three-coordinate entropy-curvature estimate with a finite coefficient comparison. Crossing theorems describe the winning intervals of the candidate distributions, and the classification gives exact extrema for singleton counts, discovery increments, and expected coverage.
Provenance statement
References
- D. Berend and A. Kontorovich, The missing mass problem , Statistics & Probability Letters 82 (2012), no. 6, 1102--1110. doi:10.1016/j.spl.2012.02.014 (https://doi.org/10.1016/j.spl.2012.02.014).DOI
- D. Berend, A. Kontorovich, and G. Zagdanski, The expected missing mass under an entropy constraint , Entropy 19 (2017), no. 7, article 315, 13 pp. doi:10.3390/e19070315 (https://doi.org/10.3390/e19070315).DOI
Version history
- v1 · 19 pagesSubmitted by Christopher LongLean 4 formalization, manuscript correspondence, and final audit: https://github.com/long-mathematics/entropy-constrained-missing-mass/tree/cfc6f0e70596b36c2309cccbb931a1c84f63ad7fCurrentNov 20, 2026