arXiv Machine Learning
PAC Learning with Multiple Correct Answers
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
Aug 27
Two Dimensions Govern Agnostic Multiclass Transductive Learning
arXiv:2608. 25326v1 Announce Type: new Abstract: In transductive classification, an adversary fixes a labeled population, one label is hidden uniformly, and the learner sees all remaining labels.
arXiv Machine Learning
Oct 19
Bandit Multiclass PAC Learning: Structural Baselines and a Confidence Direct Sum
arXiv:2609. 29694v2 Announce Type: replace Abstract: How much does high confidence cost when a multiclass learner sees only whether its prediction is correct?
arXiv Machine Learning
Jul 1
A Complete Characterization of Learnability for Adversarial Noisy Bandits
arXiv:2605. 09200v2 Announce Type: replace Abstract: We study adversarial noisy bandits given a known function class $\mathcal{F}$.
arXiv Machine Learning
Oct 15
The Statistical Benefits of Multiple Responses for Learning from Demonstrations
arXiv:2609.33291v2 Announce Type: replace-cross Abstract: Many generative systems return multiple candidate responses and are evaluated according to the best one. Recent work shows that, when demonst...
arXiv Machine Learning
Sep 25
Bandit Multiclass PAC Learning: Corrected Lower Bounds, Exact Families, and a Confidence Direct-Sum Phenomenon
The paper revisits realizable multiclass PAC learning with bandit feedback, correcting a previously claimed lower bound on sample complexity. It introduces a new anchored dimension, “aBDS,” and establishes a constant‑free three‑part lower bound, while also providing tighter upper bounds that eliminate dependence on the total label count. The authors demonstrate that the optimal sample complexity can vary dramatically even among classes with identical dimensional profiles, revealing a confidence direct‑sum phenomenon and a rank‑saturation phase transition.
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...