Training-Free Acceleration of ViTs with Delayed Spatial Merging
On the map: Efficient LLM inference and serving → Token pruning and merging for ViTs
Abstract (arXiv)
Token merging has emerged as a new paradigm that can accelerate the inference of Vision Transformers (ViTs) without any retraining or fine-tuning. To push the frontier of training-free acceleration in ViTs, we improve token merging by adding the perspectives of 1) activation outliers and 2) hierarchical representations. Through a careful analysis of the attention behavior in ViTs, we characterize a delayed onset of the convergent attention phenomenon, which makes token merging undesirable in the bottom blocks of ViTs. Moreover, we augment token merging with a hierarchical processing scheme to capture multi-scale redundancy between visual tokens. Combining these two insights, we build a unified inference framework called DSM: Delayed Spatial Merging. We extensively evaluate DSM on various ViT model scales (Tiny to Huge) and tasks (ImageNet-1k and transfer learning), achieving up to 1.8× FLOP reduction and 1.6× throughput speedup at a negligible loss while being two orders of magnitude faster than existing methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Token pruning and merging for ViTs, one of 12 directions in Efficient LLM inference and serving. Builds on 31 of its 45 references that are in the map. First posted on arXiv 4 Mar 2023.
Builds on
31 of 45 references.
Closest ancestors · 2
Same direction, newest first
- 2022Token Merging: Your ViT But Faster17 Oct
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruning27 Dec
Other references · 29
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2016Feature Pyramid Networks for Object Detectioncited by 5,021
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
17 more
- 2021Mip-NeRF: A Multiscale Representation for Anti-Aliasing Neural Radiance Fieldscited by 1,957
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2020Designing Network Design Spacescited by 954
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 562
- 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 360
- 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
- 2021Knowledge distillation: A good teacher is patient and consistentcited by 255
- 2021I-BERT: Integer-only BERT Quantizationcited by 250
- 2021Adaptive Token Sampling For Efficient Vision Transformerscited by 181
- 2022The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Modelscited by 115
- 2021Token Pooling in Vision Transformerscited by 68
- 2022Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuningcited by 33
- 2019Synchronous Transformers for End-to-End Speech Recognitioncited by 24
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 2.
4 papers.
- 2024CHOSEN: Compilation to Hardware Optimization Stack for Efficient Vision Transformer Inferencecited by 2
- 2026AdaMerge: Salience-Aware Adaptive Token Merging for Training-Free Acceleration of Vision Transformerscited by 1
- 2023CrAFT: Compression-Aware Fine-Tuning for Efficient Visual Task Adaptationcited by 0
- 2026Later Is Better: Token Reduction for ViTs Under Distribution Shiftcited by 0
- 2026Later Is Better: Token Reduction for ViTs Under Distribution Shift6 Oct 2026
- 2026AdaMerge: Salience-Aware Adaptive Token Merging for Training-Free Acceleration of Vision Transformers26 May 2026
- 2024CHOSEN: Compilation to Hardware Optimization Stack for Efficient Vision Transformer Inference17 Jul 2024
- 2023CrAFT: Compression-Aware Fine-Tuning for Efficient Visual Task Adaptation8 May 2023
Similar, not cited
Close in wording, no citation either way
- 2026MergeOver: Post-Training Token Merging for Recursive Vision Transformers
- 2025FastVGGT: Training-Free Acceleration of Visual Geometry Transformer
- 2026DORA: Dynamic Online Reinforcement Agent for Token Merging in Vision Transformers
- 2023PPT: Token Pruning and Pooling for Efficient Vision Transformers
- 2026Fusion: A Framework for Unified Sequential Token AdaptatIon in VisiOn TraNsformers
- 2023Token Fusion: Bridging the Gap between Token Pruning and Token Merging
- 2024Learning to Merge Tokens via Decoupled Embedding for Efficient Vision Transformers
- 2026ToaSt: Token Channel Selection and Structured Pruning for Efficient ViT