Adversarial Training with Stochastic Weight Average
Not on the map. Why?
Abstract (arXiv)
Adversarial training deep neural networks often experience serious overfitting problem. Recently, it is explained that the overfitting happens because the sample complexity of training data is insufficient to generalize robustness. In traditional machine learning, one way to relieve overfitting from the lack of data is to use ensemble methods. However, adversarial training multiple networks is extremely expensive. Moreover, we found that there is a dilemma on choosing target model to generate adversarial examples. Optimizing attack to the members of ensemble will be suboptimal attack to the ensemble and incurs covariate shift, while attack to ensemble will weaken the members and lose the benefit from ensembling. In this paper, we propose adversarial training with Stochastic weight average (SWA); while performing adversarial training, we aggregate the temporal weight states in the trajectory of training. By adopting SWA, the benefit of ensemble can be gained without tremendous computational increment and without facing the dilemma. Moreover, we further improved SWA to be adequate to adversarial training. The empirical results on CIFAR-10, CIFAR-100 and SVHN show that our method can improve the robustness of models.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 4; 2025: 0; 2026: 2.
12 papers.
- 2021Relating Adversarially Robust Generalization to Flat Minimacited by 57
- 2023Improving Fast Adversarial Training with Prior-Guided Knowledgecited by 34
- 2022Stability Analysis and Generalization Bounds of Adversarial Trainingcited by 30
- 2022Stochastic Weight Averaging Revisitedcited by 26
- 2022SRoUDA: Meta Self-training for Robust Unsupervised Domain Adaptationcited by 6
- 2024Conserve-Update-Revise to Cure Generalization and Robustness Trade-off in Adversarial Trainingcited by 6
- 2024PeerAiD: Improving Adversarial Distillation from a Specialized Peer Tutorcited by 6
- 2023Generating Less Certain Adversarial Examples Improves Robust Generalizationcited by 3
- 2024Criticality Leveraged Adversarial Training (CLAT) for Boosted Performance via Parameter Efficiencycited by 2
- 2024Towards Trustworthy Unsupervised Domain Adaptation: A Representation Learning Perspective for Enhancing Robustness, Discrimination, and Generalizationcited by 0
- 2026Proxy Robustness in Vision Language Models is Effortlessly Transferablecited by 0
- 2026Bayesian Generative Adversarial Networks via Gaussian Approximation for Tabular Data Synthesiscited by 0
- 2026Bayesian Generative Adversarial Networks via Gaussian Approximation for Tabular Data Synthesis25 Feb 2026
- 2026Proxy Robustness in Vision Language Models is Effortlessly Transferable19 Jan 2026
- 2024Criticality Leveraged Adversarial Training (CLAT) for Boosted Performance via Parameter Efficiency19 Aug 2024
- 2024Towards Trustworthy Unsupervised Domain Adaptation: A Representation Learning Perspective for Enhancing Robustness, Discrimination, and Generalization19 Jun 2024
- 2024PeerAiD: Improving Adversarial Distillation from a Specialized Peer Tutor11 Mar 2024
- 2024Conserve-Update-Revise to Cure Generalization and Robustness Trade-off in Adversarial Training26 Jan 2024
- 2023Generating Less Certain Adversarial Examples Improves Robust Generalization6 Oct 2023
- 2023Improving Fast Adversarial Training with Prior-Guided Knowledge1 Apr 2023
- 2022SRoUDA: Meta Self-training for Robust Unsupervised Domain Adaptation12 Dec 2022
- 2022Stability Analysis and Generalization Bounds of Adversarial Training3 Oct 2022
- 2022Stochastic Weight Averaging Revisited3 Jan 2022
- 2021Relating Adversarially Robust Generalization to Flat Minima9 Apr 2021