The paper studies learning from runs that stop at their first incorrect decision, revealing only the queries and correct labels up to that point. It analyzes how many such runs are required to learn a hypothesis from a fixed binary class of VC dimension at most $d$, providing bounds on the number of runs and distinct pilots needed to achieve a risk estimate within ε of the optimal risk. The results include upper bounds on sample complexity, treatment of unknown cost ceilings, and matching lower bounds for finite classes.
By Michal \v{C}ert\'ik
arXiv:2608. 06337v1 Announce Type: cross Abstract: A monotone adversary observes an i.
By Anay Mehrotra
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:2608. 15472v1 Announce Type: cross Abstract: The problem of networked information aggregation, studied in Kearns et al.
By Ambar Pal
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...
By Steve Hanneke, Amirreza Shaeiri
arXiv:2609.10196v1 Announce Type: cross
Abstract: Attias, Hanneke and Ramaswami (NeurIPS 2025) asked whether randomization provably reduces the oracle calls needed for online learning when the class...
By Xuan Li