Pith. sign in

REVIEW 4 cited by

Dynamic Token Reduction during Generation for Vision Language Models

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 2501.14204 v1 pith:7HKGAEI7 submitted 2025-01-24 cs.CV cs.AI

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

Vision-Language Models (VLMs) have achieved notable success in multimodal tasks but face practical limitations due to the quadratic complexity of decoder attention mechanisms and autoregressive generation. Existing methods like FASTV and VTW have achieved notable results in reducing redundant visual tokens, but these approaches focus on pruning tokens in a single forward pass without systematically analyzing the redundancy of visual tokens throughout the entire generation process. In this paper, we introduce a dynamic pruning strategy tailored for VLMs, namedDynamic Rate (DyRate), which progressively adjusts the compression rate during generation. Our analysis of the distribution of attention reveals that the importance of visual tokens decreases throughout the generation process, inspiring us to adopt a more aggressive compression rate. By integrating a lightweight predictor based on attention distribution, our approach enables flexible adjustment of pruning rates based on the attention distribution. Our experimental results demonstrate that our method not only reduces computational demands but also maintains the quality of responses.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Attending to Multimodal Generation One Token at a Time

    cs.CV 2026-07 accept novelty 7.0 of 10

    MLLMs attend to the relevant modality at the exact generation steps that need it; causal blocking of those peaks breaks answers while timed boosting improves multimodal performance.

  2. GreedyPrune: Retenting Critical Visual Token Set for Large Vision Language Models

    cs.CV 2025-06 conditional novelty 5.0 of 10

    A training-free token pruning method that combines cosine-similarity saliency with greedy redundancy removal to preserve accuracy at high compression ratios.

  3. DiffPrune: differentiable information throttling for token pruning in vision-language models

    cs.CV 2026-08 conditional novelty 4.0 of 10

    DiffPrune replaces Gumbel-Softmax surrogate gradients with a differentiable noise-throttling path for visual token scoring, achieving high accuracy retention under aggressive pruning on three VLM families.

  4. A Glimpse to Compress: Dynamic Visual Token Pruning for Large Vision-Language Models

    cs.CV 2025-08 unverdicted novelty 4.0 of 10

    The paper claims 92.6% dynamic visual-token pruning with retained (or 110% of) baseline VQA performance, but the full text supplied is a different paper, so the claim is unverifiable here.

Pith tools