The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization
By Yifei Min, Lin Chen, Amin Karbasi. 2020
73 citations recorded by the source corpus.
Adversarial training has shown its ability in producing models that are robust to perturbations on the input data, but usually at the expense of decrease in the standard accuracy. To mitigate this issue, it is commonly believed that more training data will eventually help such adversarially robust models generalize better on the benign/unperturbed test data. In this paper, however, we challenge this conventional belief and show that more training data can hurt the generalization of adversarially robust models in the classification problems. We first investigate the Gaussian mixture classification with a linear loss and identify three regimes based on the strength of the adversary. In the weak adversary regime, more data improves the generalization of adversarially robust models. In the medium adversary regime, with more training data, the generalization loss exhibits a double descent curve, which implies the existence of an intermediate stage where more training data hurts the generalization. In the strong adversary regime, more data almost immediately causes the generalization error to increase. Then we move to the analysis of a two-dimensional classification problem with a 0-1 loss. We prove that more data always hurts the generalization performance of adversarially trained models with large perturbations. To complement our theoretical results, we conduct empirical studies on Gaussian mixture classification, support vector machines (SVMs), and linear regression.
Subfields: Artificial Intelligence, Scaling & Learning Theory, Safety, Robustness & Interpretability
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Jianfeng Gao
- Percy Liang
- Quoc V. Le
- Mohit Bansal
- Alan L. Yuille
- Weizhu Chen
- Luke S. Zettlemoyer
- Yoshua Bengio
In Scaling & Learning Theory
- Mingxing Tan
- Alan L. Yuille
- Percy Liang
- Jiang Wang
- John C. Duchi
- Jianfeng Gao
- Fanny Yang
- Aditi Raghunathan
In Safety, Robustness & Interpretability
- Percy Liang
- Aditi Raghunathan
- Fanny Yang
- Alan L. Yuille
- Cihang Xie
- John C. Duchi
- Quoc V. Le
- Sang Michael Xie
Citations in the corpus
- Adversarial Training for Large Neural Language Models (2020, background): “This is very interesting as prior work often finds that adversarial training hurts generalization, even with theoretical justification (Raghunathan et al., 2019, 2020; Min et al., 2020).”
- Adversarial Examples Improve Image Recognition (2019, background): “Other works try to explain this tradeoff phenomenon from the perspective of the increased sample complexity of adversary [37, 25, 28], the limited amount of training data [1, 27, 34, 44, 48], or network overparameterization [31].”
- Understanding and Mitigating the Tradeoff Between Robustness and Accuracy (2020, background): “In concurrent and independent work, Min et al. (2020) also study the effect of dataset size on the tradeoff.”