Pith. sign in

REVIEW 20 cited by

Stop Looking for Important Tokens in Multimodal Language Models: Duplication Matters More

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 2502.11494 v2 pith:7MRRGVCH submitted 2025-02-17 cs.CL cs.CV

Stop Looking for Important Tokens in Multimodal Language Models: Duplication Matters More

classification cs.CL cs.CV
keywords tokensdarttokenduplicationleadingpruningvisionattention
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Vision tokens in multimodal large language models often dominate huge computational overhead due to their excessive length compared to linguistic modality. Abundant recent methods aim to solve this problem with token pruning, which first defines an importance criterion for tokens and then prunes the unimportant vision tokens during inference. However, in this paper, we show that the importance is not an ideal indicator to decide whether a token should be pruned. Surprisingly, it usually results in inferior performance than random token pruning and leading to incompatibility to efficient attention computation operators.Instead, we propose DART (Duplication-Aware Reduction of Tokens), which prunes tokens based on its duplication with other tokens, leading to significant and training-free acceleration. Concretely, DART selects a small subset of pivot tokens and then retains the tokens with low duplication to the pivots, ensuring minimal information loss during token pruning. Experiments demonstrate that DART can prune 88.9% vision tokens while maintaining comparable performance, leading to a 1.99$\times$ and 2.99$\times$ speed-up in total time and prefilling stage, respectively, with good compatibility to efficient attention operators. Our codes are available at https://github.com/ZichenWen1/DART.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 20 Pith papers

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

  1. Structured Redundancy Modeling for Efficient Visual Token Pruning in High-Resolution MLLMs

    cs.CV 2026-07 conditional novelty 7.0

    SFPruner performs redundancy-aware visual token pruning in a single non-iterative pass using semantics-guided ridge leverage scores and directional masking, cutting selection latency from 112.4 ms to 2.5 ms at 512 tok...

  2. LearnPruner: Rethinking Attention-based Token Pruning in Vision Language Models

    cs.CV 2026-04 unverdicted novelty 7.0

    LearnPruner prunes vision tokens to 5.5% of the original count while retaining about 95% of VLM performance and delivering 3.2 times faster inference by fixing attention sink in encoders and using unbiased middle-laye...

  3. CRISP: Pre-LLM Yet Text-Driven Visual Token Pruning for Efficient LVLM Inference

    cs.CV 2026-07 conditional novelty 6.0

    A training-free, text-driven pre-LLM pruning method that keeps ~99% of LVLM performance while retaining only ~11-22% of visual tokens.

  4. Spectral Heat Flow for Conservative Token Condensation in Vision-Language Models

    cs.CV 2026-07 conditional novelty 6.0

    A training-free VLM token pruning method that diffuses importance on a kNN graph, allocates budgets via quadtree partitioning, and adds sink tokens to retain pruned information.

  5. MS-Resampler: Multi-Scope Visual Resampling for Efficient Multimodal LLMs

    cs.CV 2026-06 unverdicted novelty 6.0

    MS-Resampler deploys multiple scope-specific resamplers with explicit spatial priors and adaptive fusion to outperform single-scope global cross-attention in MLLMs on ten benchmarks with minimal added cost.

  6. MVPruner: Dynamic Token Pruning for Accelerating Multi-view Vision-Language Models in Autonomous Driving

    cs.CV 2026-06 unverdicted novelty 6.0

    MVPruner is a two-stage dynamic token pruning technique that uses view diversity for initial budget allocation and instruction text for task-aligned selection, delivering 87.3% FLOPs reduction and 4.97x prefilling spe...

  7. When Attention Collapses: Stage-Aware Visual Token Pruning from Structure to Semantics

    cs.CV 2026-06 unverdicted novelty 6.0

    STS is a two-stage pruning framework that decouples structural diversity via repulsion sampling from semantic filtering via cross-attention to reduce redundancy in visual tokens for VLMs.

  8. Focus-then-Context: Subject-Centric Progressive Visual Token Reduction for Vision-Language Models

    cs.CV 2026-05 conditional novelty 6.0

    SPpruner reduces visual tokens in VLMs via focus identification followed by context-aware scanning, retaining 22.2% tokens for 2.53x speedup on Qwen2.5-VL with negligible accuracy loss.

  9. Make Each Token Count: Towards Improving Long-Context Performance with KV Cache Eviction

    cs.LG 2026-05 unverdicted novelty 6.0

    A unified learnable KV eviction policy with cross-layer calibration reduces memory and matches or exceeds full-cache performance on long-context tasks by retaining useful tokens and limiting attention dilution.

  10. RTPrune: Reading-Twice Inspired Token Pruning for Efficient DeepSeek-OCR Inference

    cs.CV 2026-05 unverdicted novelty 6.0

    RTPrune prunes visual tokens in DeepSeek-OCR via a reading-twice two-stage process, retaining 84.25% tokens for 99.47% accuracy and 1.23x faster prefill on OmniDocBench.

  11. ST-Prune: Training-Free Spatio-Temporal Token Pruning for Vision-Language Models in Autonomous Driving

    cs.CV 2026-04 unverdicted novelty 6.0

    ST-Prune is a training-free spatio-temporal token pruning framework for VLMs in autonomous driving that achieves near-lossless results at 90% token reduction by exploiting motion volatility, temporal recency, and mult...

  12. HAWK: Head Importance-Aware Visual Token Pruning in Multimodal Models

    cs.CV 2026-04 unverdicted novelty 6.0

    HAWK is a training-free method that prunes over 80% of visual tokens in MLLMs while retaining 96% accuracy by using head importance weights and text-guided attention to select task-relevant tokens.

  13. ViCA: Efficient Multimodal LLMs with Vision-Only Cross-Attention

    cs.CV 2026-02 conditional novelty 6.0

    Frozen visual tokens with sparse cross-attention at selected layers preserve 98% accuracy while reducing vision-side FLOPs to 4% in LLaVA-1.5 models.

  14. SepPrune:A Separator-based Pruning Framework for Efficient Multimodal Large Language Models

    cs.CV 2026-07 conditional novelty 5.0

    Using the separator token as a position-free query, SepPrune prunes 80% of vision tokens while retaining 96.3% of Qwen2.5-VL-7B's original accuracy.

  15. Spectral Heat Flow for Conservative Token Condensation in Vision-Language Models

    cs.CV 2026-07 conditional novelty 5.0

    Training-free SpecFlow condenses VLM visual tokens via kNN heat diffusion, adaptive quadtree budgets, and coreset sinks, retaining 95.6% LLaVA-1.5 performance after pruning 88.9% of tokens.

  16. MVPruner: Dynamic Token Pruning for Accelerating Multi-view Vision-Language Models in Autonomous Driving

    cs.CV 2026-06 unverdicted novelty 5.0

    MVPruner is a two-stage adaptive token pruning technique for multi-view VLMs that achieves 87.3% FLOPs reduction and 4.97x prefilling speedup while retaining 98.5% accuracy on DriveLM.

  17. RTPrune: Reading-Twice Inspired Token Pruning for Efficient DeepSeek-OCR Inference

    cs.CV 2026-05 unverdicted novelty 5.0

    RTPrune introduces a reading-twice inspired two-stage pruning technique for DeepSeek-OCR that retains 84.25% tokens while delivering 99.47% accuracy and 1.23x faster prefill on OmniDocBench.

  18. EvoComp: Learning Visual Token Compression for Multimodal Large Language Models via Semantic-Guided Evolutionary Labeling

    cs.CV 2026-04 unverdicted novelty 5.0

    EvoComp compresses visual tokens in MLLMs by 3x while retaining 99.3% accuracy via an evolutionary labeling strategy that searches for low-loss, semantically diverse token subsets.

  19. Token Reduction via Local and Global Contexts Optimization for Efficient Video Large Language Models

    cs.CV 2026-03 unverdicted novelty 5.0

    AOT reduces visual tokens in VLLMs via intra-frame and inter-frame anchors with local-global optimal transport, delivering competitive benchmark performance and efficiency gains in a training-free way.

  20. RTPrune: Reading-Twice Inspired Token Pruning for Efficient DeepSeek-OCR Inference

    cs.CV 2026-05 unverdicted novelty 4.0

    RTPrune delivers 99.47% accuracy and 1.23x faster prefill on OmniDocBench for DeepSeek-OCR-Large by retaining only 84.25% of tokens through a reading-twice inspired two-stage pruning process.