mlsanityData to 7 Oct 2026

Towards the Desirable Decision Boundary by Moderate-Margin Adversarial Training

arXiv 2207.07793 ↗First posted 16 Jul 2022cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Adversarial training, as one of the most effective defense methods against adversarial attacks, tends to learn an inclusive decision boundary to increase the robustness of deep learning models. However, due to the large and unnecessary increase in the margin along adversarial directions, adversarial training causes heavy cross-over between natural examples and adversarial examples, which is not conducive to balancing the trade-off between robustness and natural accuracy. In this paper, we propose a novel adversarial training scheme to achieve a better trade-off between robustness and natural accuracy. It aims to learn a moderate-inclusive decision boundary, which means that the margins of natural examples under the decision boundary are moderate. We call this scheme Moderate-Margin Adversarial Training (MMAT), which generates finer-grained adversarial examples to mitigate the cross-over problem. We also take advantage of logits from a teacher model that has been well-trained to guide the learning of our model. Finally, MMAT achieves high natural accuracy and robustness under both black-box and white-box attacks. On SVHN, for example, state-of-the-art robustness and natural accuracy are achieved.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 35 references that are in the map. First posted on arXiv 16 Jul 2022.

Builds on

28 of 35 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  5. 2013Intriguing properties of neural networkscited by 5,114
  6. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  7. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  8. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
  9. 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
  10. 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,097
  11. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  12. 2017Ensemble Adversarial Training: Attacks and Defensescited by 833
16 more
  1. 2020Fast is better than free: Revisiting adversarial trainingcited by 723
  2. 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 682
  3. 2015Distillation as a Defense to Adversarial Perturbations against Deep Neural Networkscited by 675
  4. 2019Adversarial Training for Free!cited by 638
  5. 2018Improving Transferability of Adversarial Examples with Input Diversitycited by 591
  6. 2016Delving into Transferable Adversarial Examples and Black-box Attackscited by 530
  7. 2018Defense-GAN: Protecting Classifiers Against Adversarial Attacks Using Generative Modelscited by 362
  8. 2019Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attackcited by 333
  9. 2020Attacks Which Do Not Kill Training Make Adversarial Learning Strongercited by 242
  10. 2017Super-Convergence: Very Fast Training of Neural Networks Using Large Learning Ratescited by 196
  11. 2018Robustness via curvature regularization, and vice versacited by 174
  12. 2018Stochastic Activation Pruning for Robust Adversarial Defensecited by 171
  13. 2021Comparing Kullback-Leibler Divergence and Mean Squared Error Loss in Knowledge Distillationcited by 131
  14. 2020Learnable Boundary Guided Adversarial Trainingcited by 93
  15. 2020Understanding the Decision Boundary of Deep Neural Networks: An Empirical Studycited by 19
  16. 2018With Friends Like These, Who Needs Adversaries?cited by 18

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.