Scale-Invariant Adversarial Attack for Evaluating and Enhancing Adversarial Defenses
Not on the map. Why?
Abstract (arXiv)
Efficient and effective attacks are crucial for reliable evaluation of defenses, and also for developing robust models. Projected Gradient Descent (PGD) attack has been demonstrated to be one of the most successful adversarial attacks. However, the effect of the standard PGD attack can be easily weakened by rescaling the logits, while the original decision of every input will not be changed. To mitigate this issue, in this paper, we propose Scale-Invariant Adversarial Attack (SI-PGD), which utilizes the angle between the features in the penultimate layer and the weights in the softmax layer to guide the generation of adversaries. The cosine angle matrix is used to learn angularly discriminative representation and will not be changed with the rescaling of logits, thus making SI-PGD attack to be stable and effective. We evaluate our attack against multiple defenses and show improved performance when compared with existing attacks. Further, we propose Scale-Invariant (SI) adversarial defense mechanism based on the cosine angle matrix, which can be embedded into the popular adversarial defenses. The experimental results show the defense method with our SI mechanism achieves state-of-the-art performance among multi-step and single-step defenses.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 28 of its 34 references that are in the map. First posted on arXiv 29 Jan 2022.
Builds on
28 of 34 references.
References · 28
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 971
- 2016Adversarial Machine Learning at Scalecited by 936
- 2017Ensemble Adversarial Training: Attacks and Defensescited by 840
- 2020Fast is better than free: Revisiting adversarial trainingcited by 727
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 685
16 more
- 2019Adversarial Training for Free!cited by 643
- 2017Countering Adversarial Images using Input Transformationscited by 520
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 416
- 2017Mitigating Adversarial Effects Through Randomizationcited by 383
- 2019Using Pre-Training Can Improve Model Robustness and Uncertaintycited by 373
- 2019Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attackcited by 334
- 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 278
- 2017NormFace: L2 Hypersphere Embedding for Face Verificationcited by 237
- 2018Adversarial Logit Pairingcited by 224
- 2018Adversarial Risk and the Dangers of Evaluating Against Weak Attackscited by 221
- 2020Understanding and Improving Fast Adversarial Trainingcited by 214
- 2020Bag of Tricks for Adversarial Trainingcited by 200
- 2020Boosting Adversarial Training with Hypersphere Embeddingcited by 97
- 2020RayS: A Ray Searching Method for Hard-label Adversarial Attackcited by 96
- 2019Controlling Neural Level Setscited by 76
- 2020Guided Adversarial Attack for Evaluating and Enhancing Adversarial Defensescited by 62
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.