Pith. sign in

REVIEW 7 cited by

Learning to Merge Tokens in Vision Transformers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.12015 v1 pith:KUTWRTSS submitted 2022-02-24 cs.CV cs.LG

classification cs.CVcs.LG
keywords computationalpatchmergerperformancetokenstransformersvisionwhileachieves
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Transformers are widely applied to solve natural language understanding and computer vision tasks. While scaling up these architectures leads to improved performance, it often comes at the expense of much higher computational costs. In order for large-scale models to remain practical in real-world systems, there is a need for reducing their computational overhead. In this work, we present the PatchMerger, a simple module that reduces the number of patches or tokens the network has to process by merging them between two consecutive intermediate layers. We show that the PatchMerger achieves a significant speedup across various model sizes while matching the original performance both upstream and downstream after fine-tuning.

Discussion (0). Sign in to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FastVGGT: Training-Free Acceleration of Visual Geometry Transformer

    cs.CV 2025-09 conditional novelty 7.0 of 10

    FastVGGT achieves 4x speedup on VGGT for 1000-image inputs using training-free token merging tailored to 3D architectures while reducing error accumulation.

  2. REDI: Corpus Aware Patch Ranking for DINOv3 Token Reduction

    cs.CV 2026-06 unverdicted novelty 6.0 of 10

    REDI combines supervised TF-IDF corpus scores over DINOv3 visual words with attention maps to rank patches, reducing sequence length 46.8% while raising Top-1 accuracy from 83.514% to 84.706% on ImageNet-1K.

  3. ConsisFormer: Compute-Efficient Transformer for Wireless Foundation Models Based on Channel Consistency

    eess.SP 2026-06 unverdicted novelty 6.0 of 10

    ConsisFormer reduces WFM Transformer complexity by over 83% via adaptive token aggregation and feature interpolation while preserving performance on channel tasks.

  4. Fast Enough to Act: Spatio-Temporal Visual Token Merging for Low-Latency Robotic VLMs and VLAs

    cs.CV 2026-06 unverdicted novelty 5.0 of 10

    ST-Merge is a plug-and-play spatio-temporal token merging method that delivers 2x speedup on VLMs and 8.3x on a VLA at high resolution with minimal accuracy loss via 3D coordinate matching and positional correction.

  5. ViCoStream: Streaming VideoLLMs Can Run Beyond 100 FPS with Stage-Wise Coordinated Inference

    cs.CV 2026-06 unverdicted novelty 5.0 of 10

    ViCoStream is a new coordinated pipeline framework for streaming VideoLLMs that achieves 134 FPS video throughput and less than 50 ms TTFT on A100 while keeping accuracy near full-history baselines.

  6. Revisiting Token Compression for Accelerating ViT-based Sparse Multi-View 3D Object Detectors

    cs.CV 2026-04 conditional novelty 5.0 of 10

    SEPatch3D accelerates ViT-based 3D object detectors up to 57% faster than StreamPETR via dynamic patch sizing and cross-granularity enhancement while keeping comparable accuracy on nuScenes and Argoverse 2.

  7. Detecting Regional Spurious Correlations in Vision Transformers via Token Discarding

    cs.CV 2025-09 conditional novelty 5.0 of 10

    A token-discarding method for vision transformers measures whether predictions rely on features outside the object's bounding box, identifying spurious correlations and problematic ImageNet classes.

Pith tools