arXiv:2609.23715v1 Announce Type: new
Abstract: Multimodal large language models (MLLMs) incur substantial computational overhead due to the reliance on hundreds of visual tokens to represent images....
By Yahong Wang, Zhangkai Ni, Juncheng Wu, Yuyin Zhou, Ying Wen, Lianghua He
Multi-vector vision-language retrieval preserves fine-grained visual evidence through maximum-similarity late interaction, but dense image-side tokens make storage and scoring expensive. Existing token compression methods reduce this cost, yet they can remove or collapse object- and region-level evidence that future query tokens may need to select.
arXiv:2605. 13178v2 Announce Type: replace-cross Abstract: In large vision-language models, visual tokens typically constitute the majority of input tokens, leading to substantial computational overhead.
By Sangin Lee, Yukyung Choi
arXiv:2609.37225v1 Announce Type: cross
Abstract: Multimodal large language models (MLLMs) have shown strong potential for universal multimodal representation learning. However, existing methods eith...
By Zijing Cai, Yuzhe Wang, Jingxian Zhu, Fengbin Zhu, Richang Hong
arXiv:2607. 04605v1 Announce Type: cross Abstract: Multi-vector vision-language retrieval preserves fine-grained visual evidence through maximum-similarity late interaction, but dense image-side tokens make storage and scoring expensive.
By Suhyeong Park, Junha Jung, Jungwoo Park, Jaewoo Kang
Abundant visual information strengthens vision-language model (VLM) perception, yet massive visual tokens raise inference costs. Existing visual token pruning methods rely on similarity-based guidance, which exploits pairwise text-vision and vision-vision token correlations for compression.
arXiv:2606.06158v2 Announce Type: replace
Abstract: Adaptive video tokenisation seeks to dynamically allocate token budgets based on the underlying visual complexity of a sequence. Current continuous...
By Kevin Dave, Sai Aditya Patkuri, Chhaya Kumar Das, Gouranga Bala, Rajeshkumar SA, R. Venkatesh Babu
arXiv:2609.35232v2 Announce Type: replace-cross
Abstract: Visual-token compression is effective for improving the efficiency of vision-language models, but under extreme compression budgets, token pr...
By Rui Zhong, Yu Li, Zheyu Yan, Cheng Zhuo
The paper investigates whether frozen Multimodal Large Language Models (MLLMs) encode grounding information about specific visual instances within the tokens they generate, including modifiers such as attributes, spatial expressions, and relational terms. The authors introduce OTTER, a lightweight supervised probe that applies Optimal Transport to align generated tokens with visual regions, producing compact grounding maps. Experiments demonstrate that modifier tokens, especially spatial terms, carry instance‑discriminative visual information, that object nouns also encode referential cues, and that the recovered grounding remains robust to context changes and generalizes to free generation and cross‑dataset transfer.
By Barbara Toniella Corradini (AI for Good), Caterina Gallegati (University of Siena, Italy), Ludovica Genovese (AI for Good), Vittorio Murino (AI for Good)
arXiv:2607. 23913v1 Announce Type: new Abstract: Modern vision-language models (VLMs) increasingly rely on dynamic or high-resolution visual encoding, producing thousands of visual tokens that substantially increase downstream language-model inference cost.
By Jun Ling, Tao Huang, Junzhuo Liu, Bowen Tang, Peng Wang
In video understanding, vision-language models (VLMs) must ingest massive numbers of visual tokens, causing the computational and memory cost of the prefill stage to rise sharply. Such visual sequences are highly redundant along the spatio-temporal dimension, yet a high compression ratio is often accompanied by the loss of critical details.
VETO (Video Efficient Token Optimization for Vision Language Models) is a plug‑in that reduces the quadratic cost of visual tokens in long‑video inference by applying dual‑axis compression: an intra‑frame compressor merges semantically similar tokens within each frame, and an inter‑frame compressor merges temporally redundant frames. By first compressing spatial dimensions, VETO lowers the cost of subsequent global temporal matching, surpassing single‑axis methods and achieving up to 45% faster inference on models such as LLaVA‑OneVision‑7B while maintaining or improving accuracy. The approach is universally applicable across LLaVA‑OneVision, InternVL‑2.5, and LongVA, preserving or enhancing zero‑shot accuracy even under extreme token budgets.
By Gueter Josmy Faure, Hao Ping Wang, Min-Hung Chen, Winston H. Hsu