Provable Unrestricted Adversarial Training Without Compromise With Generalizability

被引:2
作者
Zhang, Lilin [1 ]
Yang, Ning [1 ]
Sun, Yanchao [2 ]
Yu, Philip S. [3 ]
机构
[1] Sichuan Univ, Sch Comp Sci, Chengdu 610017, Peoples R China
[2] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[3] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
基金
中国国家自然科学基金;
关键词
Robustness; Training; Standards; Perturbation methods; Stars; Optimization; Computer science; Adversarial robustness; adversarial training; unrestricted adversarial examples; standard generalizability;
D O I
10.1109/TPAMI.2024.3400988
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Adversarial training (AT) is widely considered as the most promising strategy to defend against adversarial attacks and has drawn increasing interest from researchers. However, the existing AT methods still suffer from two challenges. First, they are unable to handle unrestricted adversarial examples (UAEs), which are built from scratch, as opposed to restricted adversarial examples (RAEs), which are created by adding perturbations bound by an l(p) norm to observed examples. Second, the existing AT methods often achieve adversarial robustness at the expense of standard generalizability (i.e., the accuracy on natural examples) because they make a tradeoff between them. To overcome these challenges, we propose a unique viewpoint that understands UAEs as imperceptibly perturbed unobserved examples. Also, we find that the tradeoff results from the separation of the distributions of adversarial examples and natural examples. Based on these ideas, we propose a novel AT approach called Provable Unrestricted Adversarial Training (PUAT), which can provide a target classifier with comprehensive adversarial robustness against both UAE and RAE, and simultaneously improve its standard generalizability. Particularly, PUAT utilizes partially labeled data to achieve effective UAE generation by accurately capturing the natural data distribution through a novel augmented triple-GAN. At the same time, PUAT extends the traditional AT by introducing the supervised loss of the target classifier into the adversarial loss and achieves the alignment between the UAE distribution, the natural data distribution, and the distribution learned by the classifier, with the collaboration of the augmented triple-GAN. Finally, the solid theoretical analysis and extensive experiments conducted on widely-used benchmarks demonstrate the superiority of PUAT.
引用
收藏
页码:8302 / 8319
页数:18
相关论文
共 68 条
[1]   Advances in Adversarial Attacks and Defenses in Computer Vision: A Survey [J].
Akhtar, Naveed ;
Mian, Ajmal ;
Kardan, Navid ;
Shah, Mubarak .
IEEE ACCESS, 2021, 9 :155161-155196
[2]  
Bai T, 2021, PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, P4312
[3]  
Bhattad A., 2020, PROC INT C LEARN REP
[4]  
Biggio Battista, 2013, Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2013. Proceedings: LNCS 8190, P387, DOI 10.1007/978-3-642-40994-3_25
[5]   Towards Evaluating the Robustness of Neural Networks [J].
Carlini, Nicholas ;
Wagner, David .
2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, :39-57
[6]  
Carmon Y, 2019, ADV NEUR IN, V32
[7]  
Cheng MH, 2020, Arxiv, DOI [arXiv:2002.06789, 10.48550/arXiv.2002.06789, DOI 10.48550/ARXIV.2002.06789]
[8]  
Chrabaszcz P, 2017, Arxiv, DOI [arXiv:1707.08819, DOI 10.48550/ARXIV.1707.08819]
[9]  
Cover T. M., 1999, Elements of Information Theory
[10]  
Croce F, 2020, PR MACH LEARN RES, V119