Toward Adversarial Robustness via Semi-supervised Robust Training
Not on the map. Why?
Abstract (arXiv)
Adversarial examples have been shown to be the severe threat to deep neural networks (DNNs). One of the most effective adversarial defense methods is adversarial training (AT) through minimizing the adversarial risk Radv, which encourages both the benign example x and its adversarially perturbed neighborhoods within the ℓp-ball to be predicted as the ground-truth label. In this work, we propose a novel defense method, the robust training (RT), by jointly minimizing two separated risks (Rstand and Rrob), which is with respect to the benign example and its neighborhoods respectively. The motivation is to explicitly and jointly enhance the accuracy and the adversarial robustness. We prove that Radv is upper-bounded by Rstand + Rrob, which implies that RT has similar effect as AT. Intuitively, minimizing the standard risk enforces the benign example to be correctly predicted, and the robust risk minimization encourages the predictions of the neighbor examples to be consistent with the prediction of the benign example. Besides, since Rrob is independent of the ground-truth label, RT is naturally extended to the semi-supervised mode (i.e., SRT), to further enhance the adversarial robustness. Moreover, we extend the ℓp-bounded neighborhood to a general case, which covers different types of perturbations, such as the pixel-wise (i.e., x + δ) or the spatial perturbation (i.e., AX + b). Extensive experiments on benchmark datasets not only verify the superiority of the proposed SRT method to state-of-the-art methods for defensing pixel-wise or spatial perturbations separately, but also demonstrate its robustness to both perturbations simultaneously. The code for reproducing main results is available at urlhttps://github.com/THUYimingLi/Semi-supervisedRobustTraining.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2.
5 papers.
- 2022Parallel Rectangle Flip Attack: A Query-based Black-box Attack against Object Detectioncited by 79
- 2021Effective and Efficient Vote Attack on Capsule Networkscited by 14
- 2023GSE: Group-wise Sparse and Explainable Adversarial Attackscited by 5
- 2021Explaining Adversarial Vulnerability with a Data Sparsity Hypothesiscited by 4
- 2023Robust Ranking Explanationscited by 0
- 2023GSE: Group-wise Sparse and Explainable Adversarial Attacks29 Nov 2023
- 2023Robust Ranking Explanations8 Jul 2023
- 2022Parallel Rectangle Flip Attack: A Query-based Black-box Attack against Object Detection22 Jan 2022
- 2021Explaining Adversarial Vulnerability with a Data Sparsity Hypothesis1 Mar 2021
- 2021Effective and Efficient Vote Attack on Capsule Networks19 Feb 2021