mlsanityData to 7 Oct 2026

Attacking Transformers with Feature Diversity Adversarial Perturbation

arXiv 2403.07942 ↗First posted 10 Mar 2024cs.CR cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Understanding the mechanisms behind Vision Transformer (ViT), particularly its vulnerability to adversarial perturba tions, is crucial for addressing challenges in its real-world applications. Existing ViT adversarial attackers rely on la bels to calculate the gradient for perturbation, and exhibit low transferability to other structures and tasks. In this paper, we present a label-free white-box attack approach for ViT-based models that exhibits strong transferability to various black box models, including most ViT variants, CNNs, and MLPs, even for models developed for other modalities. Our inspira tion comes from the feature collapse phenomenon in ViTs, where the critical attention mechanism overly depends on the low-frequency component of features, causing the features in middle-to-end layers to become increasingly similar and eventually collapse. We propose the feature diversity attacker to naturally accelerate this process and achieve remarkable performance and transferability.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 31 of its 38 references that are in the map. First posted on arXiv 10 Mar 2024.

Builds on

31 of 38 references.

References · 31

  1. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  2. 2020End-to-End Object Detection with Transformerscited by 7,384
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2016Adversarial Machine Learning at Scalecited by 934
  5. 2021Segmenter: Transformer for Semantic Segmentationcited by 855
  6. 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 671
  7. 2018Improving Transferability of Adversarial Examples with Input Diversitycited by 591
  8. 2017Adversarial Patchcited by 514
  9. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 411
  10. 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 352
  11. 2021DeepViT: Towards Deeper Vision Transformercited by 288
  12. 20213D Human Pose Estimation with Spatial and Temporal Transformerscited by 271
19 more
  1. 2021On the Robustness of Vision Transformers to Adversarial Examplescited by 167
  2. 2020Torchattacks: A PyTorch Repository for Adversarial Attackscited by 156
  3. 2022Anti-Oversmoothing in Deep Vision Transformers via the Fourier Domain Analysis: From Theory to Practicecited by 136
  4. 2020Toward Transformer-Based Object Detectioncited by 84
  5. 2021P2T: Pyramid Pooling Transformer for Scene Understandingcited by 84
  6. 2021Towards Transferable Adversarial Attacks on Vision Transformerscited by 80
  7. 2020Patch-wise Attack for Fooling Deep Neural Networkcited by 78
  8. 2021On Improving Adversarial Transferability of Vision Transformerscited by 70
  9. 2022GradViT: Gradient Inversion of Vision Transformerscited by 52
  10. 2022Patch-Fool: Are Vision Transformers Always Robust Against Adversarial Perturbations?cited by 47
  11. 2021Vision Transformers with Patch Diversificationcited by 45
  12. 2023Transferable Adversarial Attacks on Vision Transformers with Token Gradient Regularizationcited by 42
  13. 2022Towards Understanding and Boosting Adversarial Transferability from a Distribution Perspectivecited by 36
  14. 2022The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancycited by 35
  15. 2022Give Me Your Attention: Dot-Product Attention Considered Harmful for Adversarial Patch Robustnesscited by 23
  16. 2021Augmented Shortcuts for Vision Transformerscited by 19
  17. 2021Decision-based Black-box Attack Against Vision Transformers via Patch-wise Adversarial Removalcited by 16
  18. 2021A Unified Efficient Pyramid Transformer for Semantic Segmentationcited by 14
  19. 2022FG-UAP: Feature-Gathering Universal Adversarial Perturbationcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.