The paper introduces probabilistic adversarial training, a method that enhances robustness by reducing the overlap between a distance-based distribution and a victim-classifier-induced distribution. It derives a KL-based lower bound on probabilistic robustness, which serves as a tractable surrogate objective. Experiments confirm that this approach consistently improves probabilistic robustness and can even boost non-probabilistic adversarial training methods through an induced scaling factor.
By Andi Zhang, Xingyu Zhao, Siddartha Khastgir
arXiv:2607. 03075v1 Announce Type: new Abstract: Safety-critical applications require classifiers that are both robust and reliable.
By Nicolas Sournac, Ahmed Baha Ben Jmaa, Bertrand Braeckeveldt
arXiv:2506.12454v2 Announce Type: replace-cross
Abstract: What fundamentally distinguishes an adversarial attack from a misclassification due to limited model expressivity or finite data? In this wor...
By Matteo Vilucchio, Lenka Zdeborov\'a, Bruno Loureiro
arXiv:2510. 09288v2 Announce Type: replace-cross Abstract: The vulnerability of machine learning models to adversarial attacks remains a critical societal security challenge.
By Pablo G. Arce, Roi Naveiro, David R\'ios Insua
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:2610.22564v1 Announce Type: new
Abstract: Data-driven approaches often face ambiguity in datasets due to sensor or target noise, insufficient information, and noise in the input data. While bes...
By Nina Maria Gottschling, Jakob Gawlikowski, Michele Caprio
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
The paper addresses the challenge of creating machine learning learners that can guarantee provably correct predictions in difficult test-time scenarios, such as adversarial attacks and natural distribution shifts. It introduces a reliable learner with optimal theoretical guarantees for these settings and discusses practical implementations. The authors demonstrate strong performance on examples like linear separators under log-concave distributions and smooth boundary classifiers under smooth probability distributions.
By Maria-Florina Balcan, Steve Hanneke, Rattana Pukdee, Dravyansh Sharma
arXiv:2602.18674v2 Announce Type: replace
Abstract: We present a theoretical study of the robustness of parameterized neural networks to random input perturbations. Specifically, we analyze local rob...
By V\v{e}ra K\r{u}rkov\'a
arXiv:2606. 23858v1 Announce Type: cross Abstract: A primary challenge in AI safety is the existence of adversarial examples -- slightly distorted inputs that cause a neural network (NN) to misclassify.
By Merkouris Papamichail, Konstantinos Varsos, Giorgos Flouris, Jo\~ao Marques-Silva
arXiv:2211. 14966v2 Announce Type: replace Abstract: Deep neural networks (DNNs) are highly vulnerable to adversarial attacks.
By Jiancong Xiao, Yanbo Fan, Ruoyu Sun, Zhi-Quan Luo
arXiv:2608. 13514v1 Announce Type: cross Abstract: We revisit the problem of learning predictors robust to adversarial examples at test-time.
By Omar Montasser