English
Related papers

Related papers: Tango: Taming Visual Signals for Efficient Video L…

200 papers

Video large language models (VideoLLMs) show strong capability in video understanding, yet long-context inference is still dominated by massive redundant visual tokens in the prefill stage. We revisit token compression for VideoLLMs under a…

Computer Vision and Pattern Recognition · Computer Science 2026-03-31 Xinying Lin , Xuyang Liu , Yiyu Wang , Teng Ma , Wenqi Ren

In this work, we present FastAV, the first token pruning framework tailored for audio-visual large language models (AV-LLMs). While token pruning has been actively explored in standard large language models (LLMs) and vision-language models…

Machine Learning · Computer Science 2026-01-21 Chaeyoung Jung , Youngjoon Jang , Seungwoo Lee , Joon Son Chung

Video large language models (Video-LLMs) face high computational costs due to large volumes of visual tokens. Existing token compression methods typically adopt a two-stage spatiotemporal compression strategy, relying on stage-specific…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Junhao Du , Jialong Xue , Anqi Li , Jincheng Dai , Guo Lu

Multimodal Large Language Models (MLLMs) have shown remarkable versatility in understanding diverse multimodal data and tasks. However, these capabilities come with an increased model scale. While post-training pruning reduces model size in…

Computer Vision and Pattern Recognition · Computer Science 2025-05-20 Jaewoo Lee , Keyang Xuan , Chanakya Ekbote , Sandeep Polisetty , Yi R. Fung , Paul Pu Liang

Large Vision-Language Models (LVLMs) incur high computational costs due to significant redundancy in their visual tokens. To effectively reduce this cost, researchers have proposed various visual token pruning methods. However, existing…

Computer Vision and Pattern Recognition · Computer Science 2026-01-27 Wen Luo , Peng Chen , Xiaotao Huang , LiQun Huang

Video Large Language Models (VLLMs) incur substantial prefilling cost due to the large number of visual tokens. While attention-based token pruning offers a promising acceleration strategy, applying it at shallow decoder layers often causes…

Computer Vision and Pattern Recognition · Computer Science 2026-03-17 Yingjie Xia , Tao Liu , Jinglei Shi , Qingsong Xie , Heng Guo , Jian Yang , Xi Wang

Token reduction is an effective way to accelerate long-video vision-language models (VLMs), but most existing methods are designed for dense Transformers and do not directly account for hybrid architectures that interleave attention with…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Jindong Jiang , Amala Sanjay Deshmukh , Kateryna Chumachenko , Karan Sapra , Zhiding Yu , Guilin Liu , Andrew Tao , Pavlo Molchanov , Jan Kautz , Wonmin Byeon

Vision-Language Models (VLMs) demand substantial computational resources during inference, largely due to the extensive visual input tokens for representing visual information. Previous studies have noted that visual tokens tend to receive…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Cheng Yang , Yang Sui , Jinqi Xiao , Lingyi Huang , Yu Gong , Chendi Li , Jinghua Yan , Yu Bai , Ponnuswamy Sadayappan , Xia Hu , Bo Yuan

Large Vision Language Models show impressive performance across image and video understanding tasks, yet their computational cost grows rapidly with the number of visual tokens. Existing token pruning methods mitigate this issue through…

Computer Vision and Pattern Recognition · Computer Science 2026-04-02 Dong-Jae Lee , Sunghyun Baek , Junmo Kim

Large Vision-Language Models (VLMs) enable strong multimodal reasoning but incur heavy inference costs from redundant visual tokens. Token pruning alleviates this issue, yet existing approaches face limitations. Attention-based methods rely…

Computer Vision and Pattern Recognition · Computer Science 2026-03-23 Youngeun Kim , Youjia Zhang , Huiling Liu , Aecheon Jung , Sunwoo Lee , Sungeun Hong

Large Multimodal Models (LMMs) have achieved significant success across various tasks. These models usually encode visual inputs into dense token sequences, which are then concatenated with textual tokens and jointly processed by a language…

Computer Vision and Pattern Recognition · Computer Science 2025-10-03 Hao Zhang , Mengsi Lyu , Chenrui He , Yulong Ao , Yonghua Lin

Multimodal large language models (MLLMs) enhance their perceptual capabilities by integrating visual and textual information. However, processing the massive number of visual tokens incurs a significant computational cost. Existing analysis…

Computer Vision and Pattern Recognition · Computer Science 2024-12-31 Jiedong Zhuang , Lu Lu , Ming Dai , Rui Hu , Jian Chen , Qiang Liu , Haoji Hu

Vision Language Models (VLMs) struggle with long-form videos due to the quadratic complexity of attention mechanisms. We propose Language-Guided Temporal Token Pruning (LGTTP), which leverages temporal cues from queries to adaptively prune…

Computer Vision and Pattern Recognition · Computer Science 2025-08-26 Yogesh Kumar

Large Vision-Language Models (LVLMs) have shown impressive performance across multi-modal tasks by encoding images into thousands of tokens. However, the large number of image tokens results in significant computational overhead, and the…

Computer Vision and Pattern Recognition · Computer Science 2025-10-24 Kaiyuan Li , Xiaoyue Chen , Chen Gao , Yong Li , Xinlei Chen

Diffusion-based large multimodal models, such as LLaDA-V, have demonstrated impressive capabilities in vision-language understanding and generation. However, their bidirectional attention mechanism and diffusion-style iterative denoising…

Computer Vision and Pattern Recognition · Computer Science 2026-01-29 Zhewen Wan , Tianchen Song , Chen Lin , Zhiyong Zhao , Xianpeng Lang

Despite their powerful capabilities, Multimodal Large Language Models (MLLMs) suffer from considerable computational overhead due to their reliance on massive visual tokens. Recent studies have explored token pruning to alleviate this…

Computer Vision and Pattern Recognition · Computer Science 2025-10-13 Xin Zou , Di Lu , Yizhou Wang , Yibo Yan , Yuanhuiyi Lyu , Xu Zheng , Linfeng Zhang , Xuming Hu

Visual token pruning methods effectively mitigate the quadratic computational growth caused by processing high-resolution images and video frames in vision-language models (VLMs). However, existing approaches rely on predefined pruning…

Computer Vision and Pattern Recognition · Computer Science 2026-04-17 Huawei Ji , Yuanhao Sun , Yuan Jin , Cheng Deng , Jiaxin Ding , Luoyi Fu , Xinbing Wang

Although large vision-language models (LVLMs) leverage rich visual token representations to achieve strong performance on multimodal tasks, these tokens also introduce significant computational overhead during inference. Existing…

Machine Learning · Computer Science 2025-05-20 Yichen Guo , Hanze Li , Zonghao Zhang , Jinhao You , Kai Tang , Xiande Huang

Large vision-language models (LVLMs) generally contain significantly more visual tokens than their textual counterparts, resulting in a considerable computational burden. Recent efforts have been made to tackle this issue by pruning visual…

Computer Vision and Pattern Recognition · Computer Science 2025-05-13 Qizhe Zhang , Aosong Cheng , Ming Lu , Renrui Zhang , Zhiyong Zhuo , Jiajun Cao , Shaobo Guo , Qi She , Shanghang Zhang

Vision language models (VLMs) demonstrate strong capabilities in jointly processing visual and textual data. However, they often incur substantial computational overhead due to redundant visual information, particularly in long-form video…

Machine Learning · Computer Science 2025-04-25 Yudong Liu , Jingwei Sun , Yueqian Lin , Jingyang Zhang , Ming Yin , Qinsi Wang , Jianyi Zhang , Hai Li , Yiran Chen
‹ Prev 1 2 3 10 Next ›