mlsanityData to 7 Oct 2026

Existence and Minimax Theorems for Adversarial Surrogate Risks in Binary Classification

arXiv 2206.09098 ↗First posted 18 Jun 2022cs.LG math.ST stat.THcited by 15

Not on the map. Why?

Abstract (arXiv)

Adversarial training is one of the most popular methods for training methods robust to adversarial attacks, however, it is not well-understood from a theoretical perspective. We prove and existence, regularity, and minimax theorems for adversarial surrogate risks. Our results explain some empirical observations on adversarial robustness from prior work and suggest new directions in algorithm development. Furthermore, our results extend previously known existence and minimax theorems for the adversarial classification risk to surrogate risks.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 31 of its 68 references that are in the map. First posted on arXiv 18 Jun 2022.

Builds on

31 of 68 references.

References · 31

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  3. 2013Intriguing properties of neural networkscited by 5,114
  4. 2017BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chaincited by 1,052
  5. 2016Adversarial Machine Learning at Scalecited by 934
  6. 2020Fast is better than free: Revisiting adversarial trainingcited by 723
  7. 2017Evasion Attacks against Machine Learning at Test Timecited by 686
  8. 2019Adversarial Training for Free!cited by 638
  9. 2018Feature Denoising for Improving Adversarial Robustnesscited by 312
  10. 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
  11. 2018Adversarial Logit Pairingcited by 224
  12. 2018Robustness via curvature regularization, and vice versacited by 174
19 more
  1. 2017The Space of Transferable Adversarial Examplescited by 156
  2. 2019A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approachcited by 142
  3. 2021On the Convergence and Robustness of Adversarial Trainingcited by 127
  4. 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
  5. 2018Improving DNN Robustness to Adversarial Attacks using Jacobian Regularizationcited by 88
  6. 2019Lower Bounds on Adversarial Robustness from Optimal Transportcited by 52
  7. 2021Calibration and Consistency of Adversarial Surrogate Lossescited by 47
  8. 2019Adversarial Risk via Optimal Transport and Optimal Couplingscited by 36
  9. 2020Calibrated Surrogate Losses for Adversarially Robust Classificationcited by 36
  10. 2022The Many Faces of Adversarial Riskcited by 28
  11. 2020Stronger and Faster Wasserstein Adversarial Attackscited by 25
  12. 2021On the Existence of the Adversarial Bayes Classifier (Extended Version)cited by 25
  13. 2022The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classificationcited by 21
  14. 2021The Geometry of Adversarial Training in Binary Classificationcited by 20
  15. 2020Adversarial Classification: Necessary conditions and geometric flowscited by 19
  16. 2019Robustness for Non-Parametric Classification: A Generic Attack and Defensecited by 12
  17. 2022Towards Consistency in Adversarial Classificationcited by 12
  18. 2016Are Accuracy and Robustness Correlated?cited by 11
  19. 2018Interpreting Adversarial Robustness: A View from Decision Surface in Input Spacecited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 7; 2024: 4; 2025: 3; 2026: 1.

15 papers.

Sort: