mlsanityData to 7 Oct 2026

Prune Redundancy, Preserve Essence: Vision Token Compression in VLMs via Synergistic Importance-Diversity

arXiv 2603.09480 ↗First posted 10 Mar 2026cs.CVcited by 22

On the map: Multimodal LLMs / vision-language models → Visual token pruning and efficiency

also in 1 more
Abstract (arXiv)

Vision-language models (VLMs) face significant computational inefficiencies caused by excessive generation of visual tokens. While prior work shows that a large fraction of visual tokens are redundant, existing compression methods struggle to balance importance preservation and information diversity. To address this, we propose PruneSID, a training-free Synergistic Importance-Diversity approach featuring a two-stage pipeline: (1) Principal Semantic Components Analysis (PSCA) for clustering tokens into semantically coherent groups, ensuring comprehensive concept coverage, and (2) Intra-group Non-Maximum Suppression (NMS) for pruning redundant tokens while preserving key representative tokens within each group. Additionally, PruneSID incorporates an information-aware dynamic compression ratio mechanism that optimizes token compression rates based on image complexity, enabling more effective average information preservation across diverse scenes. Extensive experiments demonstrate state-of-the-art performance, achieving 96.3% accuracy on LLaVA-1.5 with only 11.1% token retention, and 92.8% accuracy at extreme compression rates (5.6%) on LLaVA-NeXT, outperforming prior methods by 2.5% with 7.8 × faster prefilling speed compared to the original model. Our framework generalizes across diverse VLMs and both image and video modalities, showcasing strong cross-modal versatility. Code is available at https://github.com/ZhengyaoFang/PruneSID.

Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). Placed in Visual token pruning and efficiency, one of 16 directions in Multimodal LLMs / vision-language models. First posted on arXiv 10 Mar 2026.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 22.

22 papers.

Sort:

By area:

  1. 2026OccamToken: Efficient VLM Inference with Training-Free and Budget-Adaptive Token Pruningcited by 3
  2. 2026ERASE: Eliminating Redundant Visual Tokens via Adaptive Two-Stage Token Pruningcited by 1
  3. 2026OTT-Vid: Optimal Transport Temporal Token Compression for Video Large Language Modelscited by 1
  4. 2026DiffPrune: differentiable information throttling for token pruning in vision-language modelscited by 1
  5. 2026RUTA: Principled Visual Token Allocation via Rate-Utility Optimizationcited by 1
  6. 2026DIVE: Dynamic Iterative Visual Evidence Construction for Efficient Vision-Language Modelscited by 1
  7. 2026Centering before Pruning: Lightweight Geometry Correction for Diversity-Based Visual Token Pruning in LVLMscited by 1
  8. 2026QCPruner: Query-Conditioned Population Coverage for Visual Token Pruningcited by 1
  9. 2026ASAP: Attention Sink Anchored Pruningcited by 0
  10. 2026DCP-Prune: Ultra-Low Token Pruning with Distribution Consistency Preservationcited by 0
  11. 2026TORINO: Token Reduction via Interpretable Concept Overlap in Vision-Language Modelscited by 0
  12. 2026LAST: The Last Query Token Guides Visual Token Pruning for Edge-Cloud Collaborative MLLM Inferencecited by 0
10 more
  1. 2026Keep the Needle, Prune the Haystack: Defect-Preserving Token Pruning for Efficient Zero-Shot Anomaly Detectioncited by 0
  2. 2026ZIPBrain: Can EEG Foundation Models Be Faster, Locally Deployable, but Accurate?cited by 0
  3. 2026Not All Visual Tokens Are Equally Safe to Remove:Consequence-Sensitive Visual Token Compressioncited by 0
  4. 2026PACE: A Unified Condense-and-Extract Paradigm for Fast VLM Inferencecited by 0
  5. 2026TRACE: Trajectory-robust Admission with Evidence Ordering for Efficient GUI Agentscited by 0
  6. 2026From Token Importance to Conditional Removability: Rethinking Visual Token Pruning in Multimodal Large Language Modelscited by 0
  7. 2026CoViST: Visual Token Compression via Composable Statescited by 0
  8. 2026ACPruner: Visual Token Pruning as Biased Attention Coverage Maximization in LVLMscited by 0
  9. 2026SPIDER: Multi-Layer Semantic Token Pruning and Adaptive Sub-Layer Skipping in Multimodal Large Language Modelscited by 0
  10. 2026Question-Specific Knowledge Graphs for Efficient Visual Reasoningcited by 0

Similar, not cited

Close in wording, no citation either way

  1. 2025A Glimpse to Compress: Dynamic Visual Token Pruning for Large Vision-Language Models
  2. 2025Hybrid Token Compression for Vision-Language Models
  3. 2026ApET: Approximation-Error Guided Token Compression for Efficient VLMs
  4. 2026AsymVLM: Asymmetric Token Pruning for Efficient Vision-Language Model Inference
  5. 2026SlimVLM: Sensitivity-aware Dynamic Structured Pruning with Adaptive Visual Token Selection for Efficient Vision-Language Models
  6. 2025GreedyPrune: Retenting Critical Visual Token Set for Large Vision Language Models
  7. 2024[CLS] Token Tells Everything Needed for Training-free Efficient MLLMs
  8. 2025Towards Lossless Ultimate Vision Token Compression for VLMs