Patch Pruning Strategy Based on Robust Statistical Measures of Attention Weight Diversity in Vision Transformers
Not on the map. Why?
Abstract (arXiv)
Multi-head self-attention is a distinctive feature extraction mechanism of vision transformers that computes pairwise relationships among all input patches, contributing significantly to their high performance. However, it is known to incur a quadratic computational complexity with respect to the number of patches. One promising approach to address this issue is patch pruning, which improves computational efficiency by identifying and removing redundant patches. In this work, we propose a patch pruning strategy that evaluates the importance of each patch based on the variance of attention weights across multiple attention heads. This approach is inspired by the design of multi-head self-attention, which aims to capture diverse attention patterns across different subspaces of feature representations. The proposed method can be easily applied during both training and inference, and achieves improved throughput while maintaining classification accuracy in scenarios such as fine-tuning with pre-trained models. In addition, we also found that using robust statistical measures, such as the median absolute deviation in place of variance, to assess patch importance can similarly lead to strong performance. Furthermore, by introducing overlapping patch embeddings, our method achieves better performance with comparable throughput to conventional approaches that utilize all patches.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 20 references that are in the map. First posted on arXiv 25 Jul 2025.
Builds on
17 of 20 references.
References · 17
- 2017Attention Is All You Needcited by 60,361
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2019Contrastive Multiview Codingcited by 1,301
- 2017Random Erasing Data Augmentationcited by 1,239
- 2022Token Merging: Your ViT But Fastercited by 1,021
5 more
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
- 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 363
- 2021DeepViT: Towards Deeper Vision Transformercited by 289
- 2018Multi-Head Attention with Disagreement Regularizationcited by 35
- 2019Multi-Head Attention with Diversity for Learning Grounded Multilingual Multimodal Representationscited by 10
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026R'enyi Attention Entropy for Patch Pruningcited by 0
- 2026R'enyi Attention Entropy for Patch Pruning4 Apr 2026