arXiv:2610. 29898v1 Announce Type: new Abstract: Haussler's covering lemma (JCTA 1995) gives the sharp $(C/\delta)^d$ metric-entropy bound for binary VC classes under normalized $\ell_1$ distance.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2608. 10869v1 Announce Type: new Abstract: Worst-case multiclass bounds do not become smaller when the best classifier is already nearly correct: what is missing is an optimistic rate, a guarantee whose fluctuation scales with the oracle risk itself.
arXiv:2602. 19172v2 Announce Type: replace Abstract: Realizable online regression can behave very differently from online classification.
arXiv:2607.17469v2 Announce Type: replace-cross Abstract: How much does an algorithm's running-time distribution under independent randomness reveal about its behavior when independence is no longer...
arXiv:2610.32853v1 Announce Type: new Abstract: We study the list replicability number in the realizable PAC learning framework and prove that every concept class $H$ over a countable domain with Lit...
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.
arXiv:2606. 00414v1 Announce Type: new Abstract: When many reinforcement-learning policies achieve near-optimal return, a post-hoc auditor may have to distinguish among many behaviorally distinct but return-equivalent policies.