Lp-norm Distortion-Efficient Adversarial Attack
Not on the map. Why?
Abstract (arXiv)
Adversarial examples have shown a powerful ability to make a well-trained model misclassified. Current mainstream adversarial attack methods only consider one of the distortions among L0-norm, L2-norm, and L_∞-norm. L0-norm based methods cause large modification on a single pixel, resulting in naked-eye visible detection, while L2-norm and L_∞-norm based methods suffer from weak robustness against adversarial defense since they always diffuse tiny perturbations to all pixels. A more realistic adversarial perturbation should be sparse and imperceptible. In this paper, we propose a novel Lp-norm distortion-efficient adversarial attack, which not only owns the least L2-norm loss but also significantly reduces the L0-norm distortion. To this aim, we design a new optimization scheme, which first optimizes an initial adversarial perturbation under L2-norm constraint, and then constructs a dimension unimportance matrix for the initial perturbation. Such a dimension unimportance matrix can indicate the adversarial unimportance of each dimension of the initial perturbation. Furthermore, we introduce a new concept of adversarial threshold for the dimension unimportance matrix. The dimensions of the initial perturbation whose unimportance is higher than the threshold will be all set to zero, greatly decreasing the L0-norm distortion. Experimental results on three benchmark datasets show that under the same query budget, the adversarial examples generated by our method have lower L0-norm and L2-norm distortion than the state-of-the-art. Especially for the MNIST dataset, our attack reduces 8.1% L2-norm distortion meanwhile remaining 47% pixels unattacked. This demonstrates the superiority of the proposed method over its competitors in terms of adversarial robustness and visual imperceptibility.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 31 references that are in the map. First posted on arXiv 3 Jul 2024.
Builds on
23 of 31 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2016Adversarial Machine Learning at Scalecited by 934
- 2016Practical Black-Box Attacks against Machine Learningcited by 893
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 499
- 2017Decision-Based Adversarial Attacks: Reliable Attacks Against Black-Box Machine Learning Modelscited by 459
- 2019Simple Black-box Adversarial Attackscited by 249
11 more
- 2017EAD: Elastic-Net Attacks to Deep Neural Networks via Adversarial Examplescited by 154
- 2018Prior Convictions: Black-Box Adversarial Attacks with Bandits and Priorscited by 145
- 2018AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networkscited by 137
- 2018Query-Efficient Hard-label Black-box Attack:An Optimization-based Approachcited by 130
- 2019Sign-OPT: A Query-Efficient Hard-label Adversarial Attackcited by 118
- 2018GenAttack: Practical Black-box Attacks with Gradient-Free Optimizationcited by 82
- 2019The Limitations of Adversarial Training and the Blind-Spot Attackcited by 63
- 2018Guessing Smart: Biased Sampling for Efficient Black-Box Adversarial Attackscited by 46
- 2020Simple and Efficient Hard Label Black-box Adversarial Attacks in Low Query Budget Regimescited by 17
- 2021Local Black-box Adversarial Attacks: A Query Efficient Approachcited by 7
- 2022Object-Attentional Untargeted Adversarial Attackcited by 2
Built on by
Not cited yet.