The paper introduces Prune-and-Merge ViT, a training‑free token compression framework for Vision Transformers that combines class‑attention pruning with similarity‑based merging to reduce computational cost while preserving semantic information. It evaluates robustness using two new metrics—Relative Accuracy Drop (RAD) and Prediction Flip Rate (PFR)—and shows that the method maintains or improves accuracy on pretrained ViT and DeiT models compared to existing token reduction techniques. The authors also argue that the hybrid approach does not induce hallucination‑like behavior and keeps predictions stable under common image transformations.
arXiv:2606. 08156v1 Announce Type: cross Abstract: Vision Transformers (ViTs) achieve strong performance but suffer from high computational costs due to quadratic self-attention complexity.
arXiv:2609.24485v1 Announce Type: new Abstract: Visual token pruning is a promising approach to reducing the inference cost of large vision-language models (LVLMs), yet aggressive token reduction oft...
arXiv:2607. 02612v1 Announce Type: cross Abstract: Vision Transformers achieve strong image classification accuracy but process all image regions with nearly the same computation, even when many regions are redundant or uninformative.
Visual token pruning is a promising approach to reducing the inference cost of large vision-language models (LVLMs), yet aggressive token reduction often causes substantial performance degradation. We...
arXiv:2610.21642v1 Announce Type: new Abstract: Vision Transformer architectures have showcased impressive performance on semantic segmentation, yet their quadratic attention complexity hinders pract...
Vision Transformer architectures have showcased impressive performance on semantic segmentation, yet their quadratic attention complexity hinders practical applications. Recent works have focused on m...
arXiv:2606. 01503v1 Announce Type: cross Abstract: Unified vision-language models (VLMs) integrate visual understanding and visual generation within a single autoregressive backbone, but their joint training is computationally expensive and largely overlooked from an efficiency perspective.
arXiv:2604. 11530v3 Announce Type: replace-cross Abstract: Vision-Language Models (VLMs) have revolutionized multi-modal learning by jointly processing visual and textual information.
ERASE is an adaptive two-stage token pruning framework designed to reduce computational overhead in Vision‑Language Models by eliminating redundant visual tokens. Stage 1 removes image‑level redundancy using lightweight raw‑image statistics, while Stage 2 progressively prunes instruction‑irrelevant tokens across decoder layers. Experiments on Qwen2.5‑VL‑7B show that ERASE retains 95.70 % of the original accuracy while keeping only 25 % of the tokens.
The paper introduces Adaptive Visual Token Pruning (AVTP), a training‑free framework that dynamically selects pruning layers and ratios for large vision‑language models (LVLMs) when processing multiple image sequences. By analyzing visual attention distributions across different LVLM architectures, AVTP adapts token retention to image importance, enabling efficient inference without relying on attention‑based computations incompatible with FlashAttention. Experiments show significant speedups—up to 2× for Qwen3VL‑8B—while preserving or even improving accuracy on multi‑image benchmarks.
LearnPruner rethinks token pruning in vision‑language models by addressing shortcomings of attention mechanisms in vision encoders and large language models. The method uses a two‑stage approach: first a learnable pruning module removes redundant vision tokens after the vision encoder, then only task‑relevant tokens are kept in the LLM’s middle layer. Experiments show that LearnPruner retains about 95% of performance while using only 5.5% of vision tokens, achieving a 3.2× speed‑up.
arXiv:2610.17412v1 Announce Type: cross Abstract: Vision Transformers incur high computational costs when processing long visual token sequences. Existing reduction methods typically rank tokens inde...