Enhance Diffusion to Improve Robust Generalization
Not on the map. Why?
Abstract (arXiv)
Deep neural networks are susceptible to human imperceptible adversarial perturbations. One of the strongest defense mechanisms is Adversarial Training (AT). In this paper, we aim to address two predominant problems in AT. First, there is still little consensus on how to set hyperparameters with a performance guarantee for AT research, and customized settings impede a fair comparison between different model designs in AT research. Second, the robustly trained neural networks struggle to generalize well and suffer from tremendous overfitting. This paper focuses on the primary AT framework - Projected Gradient Descent Adversarial Training (PGD-AT). We approximate the dynamic of PGD-AT by a continuous-time Stochastic Differential Equation (SDE), and show that the diffusion term of this SDE determines the robust generalization. An immediate implication of this theoretical finding is that robust generalization is positively correlated with the ratio between learning rate and batch size. We further propose a novel approach, Diffusion Enhanced Adversarial Training (DEAT), to manipulate the diffusion term to improve robust generalization with virtually no extra computational burden. We theoretically show that DEAT obtains a tighter generalization bound than PGD-AT. Our empirical investigation is extensive and firmly attests that DEAT universally outperforms PGD-AT by a significant margin.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 71 of its 100 references that are in the map. First posted on arXiv 5 Jun 2023.
Builds on
71 of 100 references.
References · 71
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2013Intriguing properties of neural networkscited by 5,114
38 more
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2016Identity Mappings in Deep Residual Networkscited by 1,960
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2017Ensemble Adversarial Training: Attacks and Defensescited by 833
- 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 774
- 2016Wide & Deep Learning for Recommender Systemscited by 745
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2019Adversarial Training for Free!cited by 638
- 2020Overfitting in adversarially robust deep learningcited by 504
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
- 2018Adversarial Attacks on Neural Networks for Graph Datacited by 395
- 2019Using Pre-Training Can Improve Model Robustness and Uncertaintycited by 373
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 266
- 2018Adversarial Attacks and Defences: A Surveycited by 259
- 2020Bag of Tricks for Adversarial Trainingcited by 199
- 2019You Only Propagate Once: Accelerating Adversarial Training via Maximal Principlecited by 181
- 2018MMA Training: Direct Input Space Margin Maximization through Adversarial Trainingcited by 171
- 2019Are Labels Required for Improving Adversarial Robustness?cited by 162
- 2019Adversarial Robustness through Local Linearizationcited by 146
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 141
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 134
- 2019A Primer on PAC-Bayesian Learningcited by 130
- 2021On the Convergence and Robustness of Adversarial Trainingcited by 127
- 2020Near-Optimal Algorithms for Minimax Optimizationcited by 119
- 2018Adversarial Attacks and Defences Competitioncited by 96
- 2019Defense Against Adversarial Attacks Using Feature Scattering-based Adversarial Trainingcited by 95
- 2020RayS: A Ray Searching Method for Hard-label Adversarial Attackcited by 94
- 2018Curriculum Adversarial Trainingcited by 89
50 most cited of 71 All 71 (JSON)
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.