Data Augmentation Alone Can Improve Adversarial Training

Lin Li, Michael Spratling
1/24/2023
cs.CVcs.LG

Official code: TreeLLi/DA-Alone-Improves-AT (15 stars, MIT, last commit 2023-03-24).

Abstract

Adversarial training suffers from the issue of robust overfitting, which seriously impairs its generalization performance. Data augmentation, which is effective at preventing overfitting in standard training, has been observed by many previous works to be ineffective in mitigating overfitting in adversarial training. This work proves that, contrary to previous findings, data augmentation alone can significantly boost accuracy and robustness in adversarial training. We find that the hardness and the diversity of data augmentation are important factors in combating robust overfitting. In general, diversity can improve both accuracy and robustness, while hardness can boost robustness at the cost of accuracy within a certain limit and degrade them both over that limit. To mitigate robust overfitting, we first propose a new crop transformation, Cropshift, which has improved diversity compared to the conventional one (Padcrop). We then propose a new data augmentation scheme, based on Cropshift, with much improved diversity and well-balanced hardness. Empirically, our augmentation method achieves the state-of-the-art accuracy and robustness for data augmentations in adversarial training. Furthermore, when combined with weight averaging it matches, or even exceeds, the performance of the best contemporary regularization methods for alleviating robust overfitting. Code is available at: https://github.com/TreeLLi/DA-Alone-Improves-AT.

View on arXivView PDF

Code Implementations(1)

MIT

data augmentation alone can improve adversarial training

150PythonOct 28, 20223 years agoMIT
adversarial-trainingdata-augmentationdeep-neural-networksrobust-overfitting

Similar Papers

Cite this paper

@article{li2023data,
  title  = {Data Augmentation Alone Can Improve Adversarial Training},
  author = {Lin Li and Michael Spratling},
  year   = {2023},
  eprint = {2301.09879},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.09879v1},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.09879.svg)](https://codeofpaper.com/paper/2301.09879)

Discussion