Attacks Which Do Not Kill Training Make Adversarial Learning Stronger
Zhang, Jingfeng, Xu, Xilie, Han, Bo, Niu, Gang, Cui, Lizhen, Sugiyama, Masashi, Kankanhalli, Mohan
Adversarial training based on the minimax formulation is necessary for obtaining adversarial robustness of trained models. However, it is conservative or even pessimistic so that it sometimes hurts the natural generalization. In this paper, we raise a fundamental question---do we have to trade off natural generalization for adversarial robustness? We argue that adversarial training is to employ confident adversarial data for updating the current model. We propose a novel approach of friendly adversarial training (FAT): rather than employing most adversarial data maximizing the loss, we search for least adversarial (i.e., friendly adversarial) data minimizing the loss, among the adversarial data that are confidently misclassified. Our novel formulation is easy to implement by just stopping the most adversarial data searching algorithms such as PGD (projected gradient descent) early, which we call early-stopped PGD. Theoretically, FAT is justified by an upper bound of the adversarial risk. Empirically, early-stopped PGD allows us to answer the earlier question negatively---adversarial robustness can indeed be achieved without compromising the natural generalization.
Feb-25-2020
- Country:
- North America
- United States
- Louisiana > Orleans Parish
- New Orleans (0.04)
- California
- San Francisco County > San Francisco (0.14)
- Los Angeles County > Long Beach (0.04)
- Santa Clara County > San Jose (0.04)
- San Diego County > San Diego (0.04)
- Louisiana > Orleans Parish
- Canada
- United States
- Europe > Sweden
- Asia
- Middle East > Jordan (0.04)
- Singapore > Central Region
- Singapore (0.04)
- Japan > Honshū
- Kantō > Tokyo Metropolis Prefecture > Tokyo (0.14)
- China
- Shandong Province > Jinan (0.04)
- Hong Kong (0.04)
- North America
- Genre:
- Research Report > Promising Solution (0.34)
- Technology: