mlsanityData to 14 Oct 2026

Perturbation Towards Easy Samples Improves Targeted Adversarial Transferability

arXiv 2406.05535 ↗First posted 8 Jun 2024cs.LG cs.AI cs.CRcited by 2

Not on the map. Why?

Abstract (arXiv)

The transferability of adversarial perturbations provides an effective shortcut for black-box attacks. Targeted perturbations have greater practicality but are more difficult to transfer between models. In this paper, we experimentally and theoretically demonstrated that neural networks trained on the same dataset have more consistent performance in High-Sample-Density-Regions (HSDR) of each class instead of low sample density regions. Therefore, in the target setting, adding perturbations towards HSDR of the target class is more effective in improving transferability. However, density estimation is challenging in high-dimensional scenarios. Further theoretical and experimental verification demonstrates that easy samples with low loss are more likely to be located in HSDR. Perturbations towards such easy samples in the target class can avoid density estimation for HSDR location. Based on the above facts, we verified that adding perturbations to easy samples in the target class improves targeted adversarial transferability of existing attack methods. A generative targeted attack strategy named Easy Sample Matching Attack (ESMA) is proposed, which has a higher success rate for targeted attacks and outperforms the SOTA generative method. Moreover, ESMA requires only 5% of the storage space and much less computation time comparing to the current SOTA, as ESMA attacks all classes with only one model instead of seperate models for each class. Our code is available at https://github.com/gjq100/ESMA.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 44 of its 59 references that are in the map. First posted on arXiv 8 Jun 2024.

Builds on

44 of 59 references.

References · 44

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2016Densely Connected Convolutional Networkscited by 6,720
  6. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  7. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  8. 2013Intriguing properties of neural networkscited by 5,155
  9. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
  10. 2015Fast R-CNNcited by 2,933
  11. 2015Learning Deep Features for Discriminative Localizationcited by 2,436
  12. 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,512
32 more
  1. 2016Practical Black-Box Attacks against Machine Learningcited by 903
  2. 2017Ensemble Adversarial Training: Attacks and Defensescited by 840
  3. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
  4. 2017One pixel attack for fooling deep neural networkscited by 582
  5. 2016Training Region-based Object Detectors with Online Hard Example Miningcited by 579
  6. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
  7. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
  8. 2016Delving into Transferable Adversarial Examples and Black-box Attackscited by 536
  9. 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 501
  10. 2019Evading Defenses to Transferable Adversarial Examples by Translation-Invariant Attackscited by 442
  11. 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 355
  12. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
  13. 2017Generative Adversarial Perturbationscited by 153
  14. 2019Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methodscited by 148
  15. 2021On the Convergence and Robustness of Adversarial Trainingcited by 130
  16. 2022Frequency Domain Model Augmentation for Adversarial Attackcited by 130
  17. 2018Gradient Harmonized Single-stage Detectorcited by 114
  18. 2018Adversarial Attacks and Defences Competitioncited by 96
  19. 2019Cross-Domain Transferability of Adversarial Perturbationscited by 92
  20. 2020On Success and Simplicity: A Second Look at Transferable Targeted Attackscited by 89
  21. 2022Boosting the Transferability of Adversarial Attacks with Reverse Adversarial Perturbationcited by 68
  22. 2021On Generating Transferable Targeted Perturbationscited by 65
  23. 2020Perturbing Across the Feature Hierarchy to Improve Standard and Strict Blackbox Attack Transferabilitycited by 57
  24. 2017NAG: Network for Adversary Generationcited by 51
  25. 2020Transferable Perturbations of Deep Feature Distributionscited by 51
  26. 2022Improving the Transferability of Targeted Adversarial Examples through Object-Based Diverse Inputcited by 50
  27. 2017A-Fast-RCNN: Hard Positive Generation via Adversary for Object Detectioncited by 43
  28. 2021Improving the Transferability of Adversarial Examples with Resized-Diverse-Inputs, Diversity-Ensemble and Region Fittingcited by 37
  29. 2021Boosting Transferability of Targeted Adversarial Examples via Hierarchical Generative Networkscited by 32
  30. 2022Enhancing the Self-Universality for Transferable Targeted Attackscited by 30
  31. 2022Investigating Top-k White-Box and Transferable Black-box Attackcited by 26
  32. 2021Staircase Sign Method for Boosting Adversarial Attackscited by 12

Built on by

Cited by year

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

2 papers.