arXiv Machine Learning

On the tradeoff between robustness and geometric accuracy in adversarial training

arXiv:2610. 22955v1 Announce Type: new Abstract: For non-parametric binary classification in the presence of an adversary, we prove an optimal quantitative estimate for adversarial classifiers controlling geometric accuracy, as measured by the Hausdorff distance to the Bayes classifier, in terms or their robustness, as encoded by the adversarial budget $\varepsilon$.

arXiv AI
Oct 1

Probabilistic Adversarial Training

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 Machine Learning
Sep 17

Reliable learning in challenging environments

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