mlsanityData to 7 Oct 2026

Multiple Perturbation Attack: Attack Pixelwise Under Different ℓp-norms For Better Adversarial Performance

arXiv 2212.03069 ↗First posted 5 Dec 2022cs.CV cs.CR cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Adversarial machine learning has been both a major concern and a hot topic recently, especially with the ubiquitous use of deep neural networks in the current landscape. Adversarial attacks and defenses are usually likened to a cat-and-mouse game in which defenders and attackers evolve over the time. On one hand, the goal is to develop strong and robust deep networks that are resistant to malicious actors. On the other hand, in order to achieve that, we need to devise even stronger adversarial attacks to challenge these defense models. Most of existing attacks employs a single ℓp distance (commonly, p∈1,2,∞) to define the concept of closeness and performs steepest gradient ascent w.r.t. this p-norm to update all pixels in an adversarial example in the same way. These ℓp attacks each has its own pros and cons; and there is no single attack that can successfully break through defense models that are robust against multiple ℓp norms simultaneously. Motivated by these observations, we come up with a natural approach: combining various ℓp gradient projections on a pixel level to achieve a joint adversarial perturbation. Specifically, we learn how to perturb each pixel to maximize the attack performance, while maintaining the overall visual imperceptibility of adversarial examples. Finally, through various experiments with standardized benchmarks, we show that our method outperforms most current strong attacks across state-of-the-art defense mechanisms, while retaining its ability to remain clean visually.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 28 references that are in the map. First posted on arXiv 5 Dec 2022.

Builds on

23 of 28 references.

References · 23

  1. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
  2. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  4. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  5. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  6. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
  7. 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
  8. 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
  9. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  10. 2020RobustBench: a standardized adversarial robustness benchmarkcited by 659
  11. 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
  12. 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 315
11 more
  1. 2018Deep Face Recognition: A Surveycited by 275
  2. 2020Uncovering the Limits of Adversarial Training against Norm-Bounded Adversarial Examplescited by 275
  3. 2021Improving Robustness using Generated Datacited by 233
  4. 2021Fixing Data Augmentation to Improve Adversarial Robustnesscited by 201
  5. 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
  6. 2019Adversarial Robustness Against the Union of Multiple Perturbation Modelscited by 88
  7. 2022A Light Recipe to Train Robust Vision Transformerscited by 64
  8. 2021Mind the box: l1-APGD for sparse adversarial attacks on image classifierscited by 50
  9. 2019Provable robustness against all adversarial lp-perturbations for p≥ 1cited by 39
  10. 2017Revisiting Normalized Gradient Descent: Fast Evasion of Saddle Pointscited by 28
  11. 2020Stronger and Faster Wasserstein Adversarial Attackscited by 25

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.