Pith. sign in

REVIEW 4 cited by

TokenCarve: Information-Preserving Visual Token Compression in Multimodal Large 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 2503.10501 v1 pith:WXJFORND submitted 2025-03-13 cs.CV

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

Multimodal Large Language Models (MLLMs) are becoming increasingly popular, while the high computational cost associated with multimodal data input, particularly from visual tokens, poses a significant challenge. Existing training-based token compression methods improve inference efficiency but require costly retraining, while training-free methods struggle to maintain performance when aggressively reducing token counts. In this study, we reveal that the performance degradation of MLLM closely correlates with the accelerated loss of information in the attention output matrix. This insight introduces a novel information-preserving perspective, making it possible to maintain performance even under extreme token compression. Based on this finding, we propose TokenCarve, a training-free, plug-and-play, two-stage token compression framework. The first stage employs an Information-Preservation-Guided Selection (IPGS) strategy to prune low-information tokens, while the second stage further leverages IPGS to guide token merging, minimizing information loss. Extensive experiments on 11 datasets and 2 model variants demonstrate the effectiveness of TokenCarve. It can even reduce the number of visual tokens to 22.2% of the original count, achieving a 1.23x speedup in inference, a 64% reduction in KV cache storage, and only a 1.54% drop in accuracy. Our code is available at https://github.com/ShawnTan86/TokenCarve.

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. Beyond Accuracy: Auditing Spatial Provenance in Visual Token Pruning for OCR-Critical MLLM Inference

    cs.CV 2026-07 conditional novelty 7.0 of 10

    Same-accuracy pruned vision-language prefixes can retain very different amounts of traceable OCR support (PosECR 0.620 vs 0.270 for Target vs Random at 30% budget), so pruning evaluation should report spatial provenan...

  2. OmniPack: Unified Token Compression for Efficient Omni-modal Large Language Models

    cs.CV 2026-08 conditional novelty 6.0 of 10

    A training-free two-stage token compression framework preserves 92.9% of Qwen2.5-Omni-7B's audio-visual understanding accuracy while using 6.8% of the original multimodal-token FLOPs.

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

    cs.CV 2026-02 conditional novelty 6.0 of 10

    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.

  4. Lag-Relative Sparse Attention In Long Context Training

    cs.CL 2025-06 conditional novelty 5.0 of 10

    Training a language model with LagKV's static sparse attention mask improves its robustness to KV-cache compression at 2x and 4x rates, while claims of overall average gains are not consistently supported.

Pith tools