Reducing Adversarial Training Cost with Gradient Approximation
Not on the map. Why?
Abstract (arXiv)
Deep learning models have achieved state-of-the-art performances in various domains, while they are vulnerable to the inputs with well-crafted but small perturbations, which are named after adversarial examples (AEs). Among many strategies to improve the model robustness against AEs, Projected Gradient Descent (PGD) based adversarial training is one of the most effective methods. Unfortunately, the prohibitive computational overhead of generating strong enough AEs, due to the maximization of the loss function, sometimes makes the regular PGD adversarial training impractical when using larger and more complicated models. In this paper, we propose that the adversarial loss can be approximated by the partial sum of Taylor series. Furthermore, we approximate the gradient of adversarial loss and propose a new and efficient adversarial training method, adversarial training with gradient approximation (GAAT), to reduce the cost of building up robust models. Additionally, extensive experiments demonstrate that this efficiency improvement can be achieved without any or with very little loss in accuracy on natural and adversarial examples, which show that our proposed method saves up to 60% of the training time with comparable model test accuracy on MNIST, CIFAR-10 and CIFAR-100 datasets.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 29 references that are in the map. First posted on arXiv 18 Sep 2023.
Builds on
23 of 29 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Wide Residual Networkscited by 3,057
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2016Adversarial Machine Learning at Scalecited by 934
- 2017Ensemble Adversarial Training: Attacks and Defensescited by 833
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2020Overfitting in adversarially robust deep learningcited by 504
11 more
- 2019Using Pre-Training Can Improve Model Robustness and Uncertaintycited by 373
- 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 328
- 2019Improving Adversarial Robustness via Promoting Ensemble Diversitycited by 213
- 2021On the Convergence and Robustness of Adversarial Trainingcited by 127
- 2018Curriculum Adversarial Trainingcited by 89
- 2020Second-Order Provable Defenses against Adversarial Attackscited by 39
- 2020Towards Understanding Fast Adversarial Trainingcited by 32
- 2017Ensemble Methods as a Defense to Adversarial Perturbations Against Deep Neural Networkscited by 31
- 2019Understanding Impacts of High-Order Loss Approximations and Features in Deep Learning Interpretationcited by 22
- 2016Neural Taylor Approximations: Convergence and Exploration in Rectifier Networkscited by 9
- 2020Improving the affordability of robustness training for DNNscited by 8
Built on by
Not cited yet.