DIVE: Dynamic Iterative Visual Evidence Construction for Efficient Vision-Language Models
On the map: Multimodal LLMs / vision-language models → Visual token pruning and efficiency
Abstract (arXiv)
Visual inputs in vision-language models (VLMs) are often encoded into substantially longer token sequences than text, making visual tokens a major bottleneck for efficient inference. Abundant recent methods address this bottleneck by scoring token importance and pruning low-scoring tokens in a single pass. However, one-shot scoring is insufficient because a token's prompt-relevant usefulness depends on the evidence already retained. Motivated by this insight, we introduce DIVE (Dynamic Iterative Visual Evidence Construction), a training-free framework that recasts visual-token pruning as dynamic evidence construction. DIVE repeatedly selects the remaining token with the highest residual-conditioned score, updates the visual and prompt residuals to discount the evidence already explained, and re-evaluates the remaining tokens. This select-update-re-evaluate process builds a retained set of complementary, prompt-relevant evidence. Experiments across eight image-understanding benchmarks show that DIVE consistently preserves performance across token budgets. With an 88.9% reduction in visual tokens, DIVE retains 98.2% of the uncompressed model's average performance. Code is available at https://github.com/Zhong-Chenchen/DIVE.git.
Key facts. Cited by 1 paper 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. Builds on 23 of its 39 references that are in the map. First posted on arXiv 5 Aug 2026.
Builds on
23 of 39 references.
Closest ancestors · 9
Same direction, newest first
- 2026Efficient Inference for Large Vision-Language Models: Bottlenecks, Techniques, and Prospects7 Apr
- 2026Rethinking Token Reduction for Large Vision-Language Models23 Mar
- 2026ResPrune: Text-Conditioned Subspace Reconstruction for Visual Token Pruning in Large Vision-Language Models22 Mar
- 2026Prune Redundancy, Preserve Essence: Vision Token Compression in VLMs via Synergistic Importance-Diversity10 Mar
- 2026ViTCoP: Accelerating Large Vision-Language Models via Visual and Textual Semantic Collaborative Pruning25 Jan
- 2025SCOPE: Saliency-Coverage Oriented Token Pruning for Efficient Multimodel LLMs28 Oct
- 2025MMTok: Multimodal Coverage Maximization for Efficient Inference of VLMs25 Aug
- 2025Beyond Attention or Similarity: Maximizing Conditional Diversity for Token Pruning in MLLMs12 Jun
- 2024PyramidDrop: Accelerating Your Large Vision-Language Models via Pyramid Visual Redundancy Reduction22 Oct
Other references · 14
- 2024Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolutioncited by 4,151
- 2024LLaVA-OneVision: Easy Visual Task Transfercited by 2,669
- 2016Making the V in VQA Matter: Elevating the Role of Image Understanding in Visual Question Answeringcited by 2,498
- 2025InternVL3: Exploring Advanced Training and Test-Time Recipes for Open-Source Multimodal Modelscited by 1,769
- 2024Video-MME: The First-Ever Comprehensive Evaluation Benchmark of Multi-modal LLMs in Video Analysiscited by 1,375
- 2023MVBench: A Comprehensive Multi-modal Video Understanding Benchmarkcited by 1,086
- 2022Token Merging: Your ViT But Fastercited by 995
- 2018VizWiz Grand Challenge: Answering Visual Questions from Blind Peoplecited by 852
- 2024LLaVA-NeXT-Interleave: Tackling Multi-image, Video, and 3D in Large Multimodal Modelscited by 571
- 2024LLaVA-Video: Video Instruction Tuning With Synthetic Datacited by 550
- 2025VideoLLaMA 3: Frontier Multimodal Foundation Models for Image and Video Understandingcited by 502
- 2023OCRBench: On the Hidden Mystery of OCR in Large Multimodal Modelscited by 466
2 more
- 2025Seed1.5-VL Technical Reportcited by 367
- 2025Video-XL-Pro: Reconstructive Token Compression for Extremely Long Video Understandingcited by 49
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026CoViST: Visual Token Compression via Composable Statescited by 0
- 2026CoViST: Visual Token Compression via Composable States27 Sep 2026
Similar, not cited
Close in wording, no citation either way
- 2026OccamToken: Efficient VLM Inference with Training-Free and Budget-Adaptive Token Pruning
- 2025VScan: Rethinking Visual Token Reduction for Efficient Large Vision-Language Models
- 2026PACE: A Unified Condense-and-Extract Paradigm for Fast VLM Inference
- 2025HiViS: Hiding Visual Tokens from the Drafter for Speculative Decoding in Vision-Language Models
- 2024Inference Optimal VLMs Need Fewer Visual Tokens and More Parameters
- 2026Seeing without Looking: Do Vision-Language Benchmarks Really Test Vision?
- 2026From Patching to Pruning Visual Computation in Vision Language Models
- 2025A Glimpse to Compress: Dynamic Visual Token Pruning for Large Vision-Language Models