AROID: Improving Adversarial Robustness Through Online Instance-Wise Data Augmentation

被引:2
作者
Li, Lin [1 ]
Qiu, Jianing [2 ]
Spratling, Michael [1 ,3 ]
机构
[1] Kings Coll London, Dept Informat, Aldwych, London WC2B 4BG, England
[2] Imperial Coll London, Dept Comp, London SW7 2AZ, England
[3] Univ Luxembourg, Dept Behav & Cognit Sci, L-4366 Esch Belval, Luxembourg
关键词
Adversarial robustness; Adversarial training; Data augmentation; Automated data augmentation;
D O I
10.1007/s11263-024-02206-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep neural networks are vulnerable to adversarial examples. Adversarial training (AT) is an effective defense against adversarial examples. However, AT is prone to overfitting which degrades robustness substantially. Recently, data augmentation (DA) was shown to be effective in mitigating robust overfitting if appropriately designed and optimized for AT. This work proposes a new method to automatically learn online, instance-wise, DA policies to improve robust generalization for AT. This is the first automated DA method specific for robustness. A novel policy learning objective, consisting of Vulnerability, Affinity and Diversity, is proposed and shown to be sufficiently effective and efficient to be practical for automatic DA generation during AT. Importantly, our method dramatically reduces the cost of policy search from the 5000 h of AutoAugment and the 412 h of IDBH to 9 h, making automated DA more practical to use for adversarial robustness. This allows our method to efficiently explore a large search space for a more effective DA policy and evolve the policy as training progresses. Empirically, our method is shown to outperform all competitive DA methods across various model architectures and datasets. Our DA policy reinforced vanilla AT to surpass several state-of-the-art AT methods regarding both accuracy and robustness. It can also be combined with those advanced AT methods to further boost robustness. Code and pre-trained models are available at: https://github.com/TreeLLi/AROID.
引用
收藏
页码:929 / 950
页数:22
相关论文
共 69 条
[1]  
Addepalli S, 2022, ADV NEUR IN
[2]  
Athalye A, 2018, PR MACH LEARN RES, V80
[3]  
Azizi S., 2023, T MACHINE LEARNING R
[4]   Towards Evaluating the Robustness of Neural Networks [J].
Carlini, Nicholas ;
Wagner, David .
2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, :39-57
[5]  
Carmon Y, 2019, ADV NEUR IN, V32
[6]  
Chen T., 2021, INT C LEARN REPR ICL
[7]  
Cheung T.-H., 2022, INT C LEARN REPR ICL
[8]  
Croce F., 2021, Neural Information Processing Systems Track on Datasets and Benchmarks
[9]  
Croce F, 2020, PR MACH LEARN RES, V119
[10]   Randaugment: Practical automated data augmentation with a reduced search space [J].
Cubuk, Ekin D. ;
Zoph, Barret ;
Shlens, Jonathon ;
Le, Quoc, V .
2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION WORKSHOPS (CVPRW 2020), 2020, :3008-3017