arXiv:2604.03414v2 Announce Type: replace
Abstract: Video Large Language Models (Video LLMs) achieve strong performance on video understanding tasks but suffer from high inference costs due to the la...
By Haifeng Huang, Biyin Xu, Yang Li
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
arXiv:2609.16722v1 Announce Type: new
Abstract: Scaling Multimodal Large Language Models (MLLMs) to long-form video understanding is bottlenecked by the explosion of visual tokens, which saturates co...
By Haoyu Guo, Yuan Feng, Junlin Lv, Mingjun Xiao, S Kevin Zhou, Xike Xie
The paper surveys training‑free methods to accelerate inference in Video Large Language Models (VLMs), aiming to reduce computational, latency, and memory costs while retaining task‑relevant spatiotemporal evidence. It categorizes techniques by their intervention points in the inference pipeline—input, visual encoding, projector, prefill, and decoding—and discusses post‑training quantization as a cross‑stage approach. The authors analyze how the position of each intervention influences evidence preservation and computational savings, noting that local efficiency gains may not lead to overall acceleration, and they provide quantitative comparisons from prior work and new experiments to evaluate accuracy‑latency trade‑offs.
By Yuqi Li, Chuanyue Yan, Neil Rodrigues, Xianglong Wang, Xiaoqin Feng, Junming Liu, Xi Xiao, Zhongwei Cheng, Wei Li, Lin Chen, Yingli Tian
AdaAlloc is a training‑free inference framework that adaptively allocates visual tokens between a global video overview and localized visual detail for long‑video question answering. It first plans a global/local allocation policy, uses temporal grounding to locate candidate evidence segments, and refines them into a compact temporal memory. The selected policy controls both frame sampling density and resolution, combining sparse, lower‑resolution global frames with denser, higher‑resolution local frames, and achieves up to 10.5 percentage‑point improvements over budget‑matched uniform sampling on several benchmarks.
By Joungbin An, Kristen Grauman
Video large language models (VLLMs) need long visual token sequences, making token compression essential for efficient inference. This paper introduces a training‑free token compression method that leverages existing video codec information—such as reference‑frame dependencies, motion vectors, and residuals—to guide low‑cost search for token protection and temporal merging. Experiments on three VLLMs and four benchmarks show that the method matches or surpasses the FlashVID baseline while dramatically reducing feature comparisons.
By Xihua Sheng, Ruijie Liu, Chang Wen Chen
Video large language models (VLLMs) need long visual token sequences, making token compression essential for efficient inference. This paper introduces a training‑free token compression technique that leverages existing video codec information—such as reference‑frame dependencies, motion vectors, and residuals—to guide low‑cost search priors. By aligning these codec cues with the visual token grid, the method creates compact candidate pools for token protection and localized candidates for temporal token merging, reducing feature comparisons while maintaining performance comparable to or better than the FlashVID baseline across multiple VLLMs and benchmarks.
Scaling Multimodal Large Language Models (MLLMs) to long-form video understanding is bottlenecked by the explosion of visual tokens, which saturates context windows and incurs prohibitive costs. Curre...
arXiv:2608.20473v1 Announce Type: new
Abstract: Video language models process videos as dense visual-token sequences with substantial representational redundancy. Compressing these sequences is there...
By Wenti Yin, Xiaotian Han, Junyuan Shang, Yuchen Ding, Shuohuan Wang, Dianhai Yu, Changxin Gao, Nong Sang
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:2608. 03112v1 Announce Type: cross Abstract: Vision-language models excel at image and video understanding but suffer from high inference latency due to the need to process thousands of tokens per image, limiting their deployment on resource-constrained edge devices and in real-time surveillance applications.
By Paribesh Regmi, Qingshuang Chen, Chi Zhang, Heba Aly, Yelin Kim, Hongda Mao
arXiv:2609.10355v1 Announce Type: cross
Abstract: Video understanding has rapidly evolved toward video large language models (VideoLLMs): systems that couple video representations with pretrained lar...
By Killian Steunou, Yannis Tevissen, Moun\^im A. El Yacoubi