mlsanityData to 7 Oct 2026

AdaMerge: Salience-Aware Adaptive Token Merging for Training-Free Acceleration of Vision Transformers

arXiv 2605.27465 ↗First posted 26 May 2026cs.CV cs.AIcited by 1

On the map: Efficient LLM inference and serving → Token pruning and merging for ViTs

Abstract (arXiv)

The quadratic cost of self-attention in Vision Transformers (ViTs) constitutes a fundamental bottleneck for practical deployment, motivating a vibrant line of research on token reduction. Among existing approaches, token merging (ToMe) has emerged as an elegant training-free solution; yet its design rests on an unspoken premise of token equality, which contravenes the well-documented non-uniformity of self-attention and leads to information loss in high-salience tokens under aggressive compression. We address this limitation with AdaMerge, a token-merging framework based on two complementary mechanisms. First, salience-weighted similarity leverages column-wise feature-affinity centrality as a token-importance proxy and incorporates the resulting salience scores into the bipartite matching score, ensuring that pivotal tokens contribute more strongly to the merged representation. Second, adaptive merging intensity uses pre-computed layer-wise similarity statistics to dynamically modulate the per-layer reduction count in accordance with input-specific redundancy. On ImageNet-1k with ViT-B/16, AdaMerge consistently outperforms ToMe, PiToMe, and DSM across all FLOPs-matched regimes. The accuracy gap widens monotonically with compression: at the 13.4G FLOPs operating point, AdaMerge sustains a Top-1 degradation of only -1.06%, compared to -1.45% for PiToMe and -4.62% for DSM. To our knowledge, AdaMerge is the first to combine salience-weighted similarity and adaptive per-layer reduction into a single training-free token merging framework, advancing the accuracy-FLOPs Pareto frontier of ViT acceleration.

Key facts. Cited by 1 paper 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 20 of its 22 references that are in the map. First posted on arXiv 26 May 2026.

Builds on

20 of 22 references.

Closest ancestors · 4

Same direction, newest first

  1. 2024Accelerating Transformers with Spectrum-Preserving Token Merging25 May
  2. 2023Training-Free Acceleration of ViTs with Delayed Spatial Merging4 Mar
  3. 2022Token Merging: Your ViT But Faster17 Oct
  4. 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer3 Aug

Other references · 16

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  3. 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
  4. 2023Vision Transformers Need Registerscited by 844
  5. 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 671
  6. 2020Transformer Interpretability Beyond Attention Visualizationcited by 620
  7. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
  8. 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 360
  9. 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 359
  10. 2022How Do Vision Transformers Work?cited by 305
  11. 2021AdaViT: Adaptive Vision Transformers for Efficient Image Recognitioncited by 228
  12. 2021Adaptive Token Sampling For Efficient Vision Transformerscited by 181
4 more
  1. 2021Patch Slimming for Efficient Vision Transformerscited by 131
  2. 2021IA-RED2: Interpretability-Aware Redundancy Reduction for Vision Transformerscited by 127
  3. 2021Vision Transformer Pruningcited by 77
  4. 2024Salience-Based Adaptive Masking: Revisiting Token Dynamics for Enhanced Pre-trainingcited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Lossless Token Merging Even Without Fine-Tuning in Vision Transformers
  2. 2023Token Fusion: Bridging the Gap between Token Pruning and Token Merging
  3. 2026Fusion: A Framework for Unified Sequential Token AdaptatIon in VisiOn TraNsformers
  4. 2026RAPID: Layer-Wise Redundancy-Aware Pruning and Importance-Driven Token Merging for Efficient ViT
  5. 2025Similarity-Aware Token Pruning: Your VLM but Faster
  6. 2024Learning to Merge Tokens via Decoupled Embedding for Efficient Vision Transformers
  7. 2026MaMe & MaRe: Matrix-Based Token Merging and Restoration for Efficient Visual Perception and Synthesis
  8. 2023PPT: Token Pruning and Pooling for Efficient Vision Transformers