Provable Unrestricted Adversarial Training Without Compromise With Generalizability

被引:1
|
作者
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
相关论文
共 50 条
  • [41] Provable Robustness against a Union of l0 Adversarial Attacks
    Hammoudeh, Zayd
    Lowd, Daniel
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 19, 2024, : 21134 - 21142
  • [42] VoteTRANS: Detecting Adversarial Text without Training by Voting on Hard Labels of Transformations
    Hoang-Quoc Nguyen-Son
    Hidano, Seira
    Fukushima, Kazuhide
    Kiyomoto, Shinsaku
    Echizen, Isao
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, 2023, : 5090 - 5104
  • [43] Provable training set debugging for linear regression
    Zhang, Xiaomin
    Zhu, Xiaojin
    Loh, Po-Ling
    MACHINE LEARNING, 2021, 110 (10) : 2763 - 2834
  • [44] ADVERSARIAL TRAINING FOR DATA-DRIVEN SPEECH ENHANCEMENT WITHOUT PARALLEL CORPUS
    Higuchi, Takuya
    Kinoshita, Keisuke
    Delcroix, Marc
    Nakatani, Tomohiro
    2017 IEEE AUTOMATIC SPEECH RECOGNITION AND UNDERSTANDING WORKSHOP (ASRU), 2017, : 40 - 47
  • [45] Without compromise (retrospective exhibition)
    Zupan, Ivica
    ARS ADRIATICA, 2015, (05) : 225 - 238
  • [46] Antifungal Treatment without Compromise
    Karam, George
    INTERNATIONAL JOURNAL OF ANTIMICROBIAL AGENTS, 2005, 26 : S56 - S56
  • [47] Save time without the compromise
    British Dental Journal, 2018, 224 : 462 - 462
  • [48] Hybrid Clouds Without Compromise
    Doyle, Jeff
    FORBES, 2015, 196 (04): : 1 - +
  • [49] Save time without a compromise
    British Dental Journal, 2020, 228 : 221 - 221
  • [50] Save time without the compromise
    不详
    BRITISH DENTAL JOURNAL, 2018, 224 (06) : 462 - 462