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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.