English
Related papers

Related papers: TransPrune: Token Transition Pruning for Efficient…

200 papers

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

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

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

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

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

Large Vision-Language Models (LVLMs) represent a significant advancement toward achieving superior multimodal capabilities by enabling powerful Large Language Models (LLMs) to understand visual input. Typically, LVLMs utilize visual…

Computer Vision and Pattern Recognition · Computer Science 2024-11-22 Lei Jiang , Weizhe Huang , Tongxuan Liu , Yuting Zeng , Jing Li , Lechao Cheng , Xiaohua Xu

Vision-Language Models (VLMs) have recently demonstrated remarkable capabilities in visual understanding and reasoning, but they also impose significant computational burdens due to long visual sequence inputs. Recent works address this…

Computer Vision and Pattern Recognition · Computer Science 2026-04-28 Rinyoichi Takezoe , Yaqian Li , Zihao Bo , Anzhou Hou , Mo Guang , Kaiwen Long

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

Large Multimodal Models (LMMs) excel in visual-language tasks by leveraging numerous visual tokens for fine-grained visual information, but this token redundancy results in significant computational costs. Previous research aimed at…

Computer Vision and Pattern Recognition · Computer Science 2025-09-12 Sihan Yang , Runsen Xu , Chenhang Cui , Tai Wang , Dahua Lin , Jiangmiao Pang

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

For multimodal large language models (MLLMs), visual information is relatively sparse compared with text. As a result, research on visual pruning emerges for efficient inference. Current approaches typically measure token importance based…

Computer Vision and Pattern Recognition · Computer Science 2026-04-06 Jiameng Li , Aleksei Tiulpin , Matthew B. Blaschko

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

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

Recent advances have explored visual token pruning to accelerate the inference of large vision-language models (LVLMs). However, existing methods often struggle to balance token importance and diversity: importance-based methods tend to…

Computer Vision and Pattern Recognition · Computer Science 2026-04-08 Zhaohong Huang , Wenjing Liu , Yuxin Zhang , Fei Chao , Rongrong Ji

Multimodal large language models (MLLMs) incur substantial inference cost due to the processing of hundreds of visual tokens per image. Although token pruning has proven effective for accelerating inference, determining when and where to…

Computer Vision and Pattern Recognition · Computer Science 2026-02-20 Yahong Wang , Juncheng Wu , Zhangkai Ni , Chengmei Yang , Yihang Liu , Longzhen Yang , Yuyin Zhou , Ying Wen , Lianghua 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

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

Visual token pruning reduces the computational cost of Vision-Language Models (VLMs) by removing redundant visual tokens. Existing methods typically rely on Gumbel-Softmax to approximate discrete selection during training. However, the…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Landi He , Mingde Yao , Shawn Young , Lijian Xu

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

Vision Large Language Models (VLLMs) incur high computational costs due to their reliance on hundreds of visual tokens to represent images. While token pruning offers a promising solution for accelerating inference, this paper, however,…

Computer Vision and Pattern Recognition · Computer Science 2026-03-10 Yahong Wang , Juncheng Wu , Zhangkai Ni , Longzhen Yang , Yihang Liu , Chengmei Yang , Ying Wen , Lianghua He , Xianfeng Tang , Hui Liu , Yuyin Zhou
‹ Prev 1 2 3 10 Next ›