English
Related papers

Related papers: GreedyPrune: Retenting Critical Visual Token Set f…

200 papers

In this paper, we introduce PruneVid, a visual token pruning method designed to enhance the efficiency of multi-modal video understanding. Large Language Models (LLMs) have shown promising performance in video tasks due to their extended…

Computer Vision and Pattern Recognition · Computer Science 2024-12-23 Xiaohu Huang , Hao Zhou , Kai Han

Recent multimodal large language models are computationally expensive because Transformers must process a large number of visual tokens. We present ReDiPrune, a training-free token pruning method applied before the vision-language…

Computer Vision and Pattern Recognition · Computer Science 2026-04-01 An Yu , Ting Yu Tsai , Zhenfei Zhang , Weiheng Lu , Felix X. -F. Ye , Ming-Ching Chang

Vision-language models (VLMs) excel at image understanding tasks, but the large number of visual tokens imposes significant computational costs, hindering deployment on mobile devices. Many pruning methods rely solely on token importance…

Computer Vision and Pattern Recognition · Computer Science 2026-02-27 Zhenkai Wu , Xiaowen Ma , Zhenliang Ni , Dengming Zhang , Han Shu , Xin Jiang , Xinghao Chen

Large Vision-Language Models (LVLMs) have adopted visual token pruning strategies to mitigate substantial computational overhead incurred by extensive visual token sequences. While prior works primarily focus on either attention-based or…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Changwoo Baek , Jouwon Song , Sohyeon Kim , Kyeongbo Kong

Large Multimodal Models (LMMs) have emerged as powerful models capable of understanding various data modalities, including text, images, and videos. LMMs encode both text and visual data into tokens that are then combined and processed by…

Computer Vision and Pattern Recognition · Computer Science 2025-04-03 Saeed Ranjbar Alvar , Gursimran Singh , Mohammad Akbari , Yong Zhang

As the computational needs of Large Vision-Language Models (LVLMs) increase, visual token pruning has proven effective in improving inference speed and memory efficiency. Traditional pruning methods in LVLMs predominantly focus on attention…

Computer Vision and Pattern Recognition · Computer Science 2025-03-12 Bozhi Luan , Wengang Zhou , Hao Feng , Zhe Wang , Xiaosong Li , Houqiang Li

Visual token compression is critical for Large Vision-Language Models (LVLMs) to efficiently process high-resolution inputs. Existing methods that typically adopt fixed compression ratios cannot adapt to scenes of varying complexity, often…

Computer Vision and Pattern Recognition · Computer Science 2025-08-05 Quan-Sheng Zeng , Yunheng Li , Qilong Wang , Peng-Tao Jiang , Zuxuan Wu , Ming-Ming Cheng , Qibin Hou

Large Vision-Language Models (LVLMs) rely on dense visual tokens to capture fine-grained visual information, but processing all these tokens incurs substantial computational and memory overhead during inference. To address this issue, we…

Machine Learning · Computer Science 2026-03-24 Xu Li , Yi Zheng , Yuxuan Liang , Zhe Liu , Xiaolei Chen , Haotian Chen , Rui Zhu , Xiangyang Xue

Vision-Language Models (VLMs) have revolutionized multi-modal learning by jointly processing visual and textual information. Yet, they face significant challenges due to the high computational and memory demands of processing long sequences…

Computer Vision and Pattern Recognition · Computer Science 2026-05-21 Yvon Apedo , Martyna Poreba , Michal Szczepanski , Samia Bouchafa

Recent progress in Multimodal Large Language Models(MLLMs) often use large image tokens to compensate the visual shortcoming of MLLMs, which not only exhibits obvious redundancy but also greatly exacerbates the already high computation.…

Computer Vision and Pattern Recognition · Computer Science 2024-12-30 Weihao Ye , Qiong Wu , Wenhao Lin , Yiyi Zhou

Recent Multimodal Large Language Models(MLLMs) often use a large number of visual tokens to compensate their visual shortcoming, leading to excessive computation and obvious visual redundancy. In this paper, we investigate what kind of…

Computer Vision and Pattern Recognition · Computer Science 2025-01-07 Yutao Jiang , Qiong Wu , Wenhao Lin , Wei Yu , Yiyi Zhou

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

As the capabilities of Vision-Language Models (VLMs) advance, they can process increasingly large inputs, which, unlike in LLMs, generates significant visual token redundancy and leads to prohibitive inference costs. While many methods aim…

Computer Vision and Pattern Recognition · Computer Science 2025-10-21 Pu Zhang , Yuwei Li , Xingyuan Xian , Guoming Tang

Multimodal Large Language Models (MLLMs) typically process a large number of visual tokens, leading to considerable computational overhead, even though many of these tokens are redundant. Existing visual token pruning methods primarily…

Computer Vision and Pattern Recognition · Computer Science 2025-10-29 Jinhong Deng , Wen Li , Joey Tianyi Zhou , Yang He

Multimodal Large Language Models (MLLMs) have demonstrated impressive capabilities, yet they encounter significant computational bottlenecks due to the massive volume of visual tokens. Consequently, visual token pruning, which substantially…

Computer Vision and Pattern Recognition · Computer Science 2026-02-17 Yifan Tan , Yifu Sun , Shirui Huang , Hong Liu , Guanghua Yu , Jianchen Zhu , Yangdong Deng

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

Multi-modal Large Language Models (MLLMs) have achieved remarkable success by integrating visual and textual modalities. However, they incur significant computational overhead due to the large number of vision tokens processed, limiting…

Computation and Language · Computer Science 2025-03-11 Yizheng Sun , Yanze Xin , Hao Li , Jingyuan Sun , Chenghua Lin , Riza Batista-Navarro

Visual token pruning is a promising approach for reducing the computational cost of vision-language models (VLMs), and existing methods often rely on early pruning decisions to improve efficiency. While effective on coarse-grained reasoning…

Computer Vision and Pattern Recognition · Computer Science 2026-02-04 Chen Qian , Xinran Yu , Danyang Li , Guoxuan Chi , Zheng Yang , Qiang Ma , Xin Miao

Multimodal large language models (MLLMs) have shown remarkable capabilities in a wide range of vision-language tasks. However, the large number of visual tokens introduces significant computational overhead. To address this issue, visual…

Computer Vision and Pattern Recognition · Computer Science 2025-11-14 Yuxiang Duan , Ao Li , Yingqin Li , Luyu Li , Pengwei Wang

Multimodal large language models (MLLMs) have shown remarkable performance for cross-modal understanding and generation, yet still suffer from severe inference costs. Recently, abundant works have been proposed to solve this problem with…

Computation and Language · Computer Science 2025-05-30 Zichen Wen , Yifeng Gao , Weijia Li , Conghui He , Linfeng Zhang
‹ Prev 1 2 3 10 Next ›