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.
Distribution Estimation under the Infinity Norm
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.