REVIEW 1 cited by
Distribution Estimation under the Infinity Norm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees for the maximum likelihood estimator significantly improve upon the currently known results. A variety of techniques are utilized and innovated upon, including Chernoff-type inequalities and empirical Bernstein bounds. We illustrate our results in synthetic and real-world experiments. Finally, we apply our proposed framework to a basic selective inference problem, where we estimate the most frequent probabilities in a sample.
Forward citations
Cited by 1 Pith paper
-
The Role of Randomness in Stability
Randomness complexity for replicability and differential privacy equals, up to one bit, the inverse log of global stability, and finite randomness complexity of PAC learning exactly matches finite Littlestone dimension.
Discussion (0). Continue with ORCID to comment.