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. 29694v2 Announce Type: replace Abstract: How much does high confidence cost when a multiclass learner sees only whether its prediction is correct?
By Guangjian Zhang, Zhengyi Yang, Xiaoyang Wang
arXiv:2611. 13210v1 Announce Type: cross Abstract: We study the problem of agnostic PAC learning under deterministic labels, where the examples are labeled by an arbitrary deterministic function, which need not belong to the concept class $C$.
By Shai Ben-David, Steve Hanneke, Farnam Mansouri, Amirreza Shaeiri
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.
By Xiaoyu Li, Andi Han, Jiaojiao Jiang, Junbin Gao
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. 06337v1 Announce Type: cross Abstract: A monotone adversary observes an i.
By Anay Mehrotra
The paper investigates realizable PAC learning under approximate differential privacy and develops a framework for establishing lower bounds on sample complexity. It demonstrates that classes sharing the same VC and Littlestone dimensions can have different private sample complexities, introducing the Independent Class Packing (ICP) parameter to capture this distinction. Using ICP, the authors derive tight lower bounds for several hypothesis classes, including axis-aligned rectangles, unions of intervals, linear subspaces, and improved bounds for halfspaces and convex polygons, and show that ICP characterizes private PAC sample complexity for product classes up to logarithmic factors.
By Prathamesh Dharangutte, Amartya Sanyal
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.
By Guangjian Zhang
arXiv:2606. 25170v1 Announce Type: cross Abstract: We study PAC learning in tabular discounted Markov decision processes with exogenous i.
By Corentin Pla, Hugo Richard, Marc Abeille, Vianney Perchet
arXiv:2606. 29331v1 Announce Type: new Abstract: Scientific discovery via symbolic regression is often viewed as statistically and computationally intractable because the hypothesis space of expressions grows combinatorially with depth.
By \c{S}uayp Talha Kocabay, Talha R\"uzgar Akku\c{s}, Kerem Yal\c{c}{\i}n
arXiv:2608. 04686v1 Announce Type: new Abstract: We study distributionally robust PAC learning for the $0$--$1$-loss, where adversarial perturbations of the data distribution are constrained by a Cressie--Read divergence of order $k>1$ and radius $\rho\geq 0$.
By Elad Aigner-Horev, Daniel Rosenberg, Roi Weiss
arXiv:2611. 05133v2 Announce Type: replace Abstract: We study PAC learning when each example comes with a set of at most $\ell$ correct labels and a prediction is correct if it belongs to this set.
By Steve Hanneke, Farnam Mansouri, Alireza F. Pour, Amirreza Shaeiri, Kun Wang