arXiv Machine Learning
Near-Optimal List Replicability from Littlestone Dimension
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Oct 19
Nearly Linear Private Learning of Littlestone Classes
arXiv:2610. 23160v1 Announce Type: new Abstract: Differentially private learning aims to learn from data while protecting individual training examples.
arXiv Statistics ML
2d ago
Strictly Replicable Realizable Learning: Unknown Marginals, Finite-Class Interpolation, and the Cost of Shared Randomness
arXiv:2610. 26944v2 Announce Type: replace Abstract: Strict replicability requires two independent training samples, processed with the same random seed, to produce exactly the same hypothesis.
Hugging Face Trending Papers
Sep 21
Adversarially Robust PAC Learning with Optimal VC Rates
We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distribution over $\mathcal{X} \times \{0,1\}$, as in clas...
arXiv Machine Learning
Aug 7
Optimal Rates for Learning with Monotone Adversaries
arXiv:2608. 06337v1 Announce Type: cross Abstract: A monotone adversary observes an i.
arXiv Machine Learning
Sep 22
Adversarially Robust PAC Learning with Optimal VC Rates
arXiv:2609.24260v1 Announce Type: cross Abstract: We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distrib...
arXiv Machine Learning
Oct 2
Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
arXiv:2605.13684v2 Announce Type: replace Abstract: We study the optimal scale at which real-valued function classes exhibit uniform convergence and learnability. Our main result establishes a scale-...