English
Related papers

Related papers: ResPrune: Text-Conditioned Subspace Reconstruction…

200 papers

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

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

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

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

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) 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

Large Vision-Language Models (LVLMs) have advanced multimodal learning but face high computational costs due to the large number of visual tokens, motivating token pruning to improve inference efficiency. The key challenge lies in…

Computer Vision and Pattern Recognition · Computer Science 2025-11-18 Ao Li , Yuxiang Duan , Jinghui Zhang , Congbo Ma , Yutong Xie , Gustavo Carneiro , Mohammad Yaqub , Hu Wang

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

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

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

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

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

While Large Vision Language Models (LVLMs) demonstrate impressive capabilities, their substantial computational and memory requirements pose deployment challenges on resource-constrained edge devices. Current parameter reduction techniques…

Computation and Language · Computer Science 2026-04-28 Yiran Huang , Lukas Thede , Massimiliano Mancini , Wenjia Xu , Zeynep Akata

Multimodal Large Language Models (MLLMs) have shown strong performance in vision-language tasks, but their inference efficiency is severely limited by the exponential growth of visual tokens in complex scenarios such as high-resolution…

Computer Vision and Pattern Recognition · Computer Science 2026-03-05 Yuhao Chen , Bin Shan , Xin Ye , Cheng Chen

Large Vision-Language Models (LVLMs) incur substantial inference costs due to the processing of a vast number of visual tokens. Existing methods typically struggle to model progressive visual token reduction as a multi-step decision process…

Computer Vision and Pattern Recognition · Computer Science 2026-03-17 Sihan Cao , Jianwei Zhang , Pengcheng Zheng , Jiaxin Yan , Caiyan Qin , Yalan Ye , Wei Dong , Peng Wang , Yang Yang , Chaoning Zhang

Visual token reduction is critical for accelerating Vision-Language Models (VLMs), yet most existing approaches rely on a fixed budget shared across all inputs, overlooking the substantial variation in image information density. We propose…

Computer Vision and Pattern Recognition · Computer Science 2026-03-09 Jialuo He , Huangxun Chen

In vision-language models (VLMs), visual tokens usually bear a significant amount of computational overhead despite sparsity of information in them when compared to text tokens. To address this, most existing methods learn a network to…

Computer Vision and Pattern Recognition · Computer Science 2025-06-04 Yuan Zhang , Chun-Kai Fan , Junpeng Ma , Wenzhao Zheng , Tao Huang , Kuan Cheng , Denis Gudovskiy , Tomoyuki Okuno , Yohei Nakata , Kurt Keutzer , Shanghang Zhang

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

Large Vision-Language Models (LVLMs) achieve impressive performance across multiple tasks. A significant challenge, however, is their prohibitive inference cost when processing high-resolution visual inputs. While visual token pruning has…

Computer Vision and Pattern Recognition · Computer Science 2026-02-04 Zhichao Sun , Yidong Ma , Gang Liu , Yibo Chen , Xu Tang , Yao Hu , Yongchao Xu
‹ Prev 1 2 3 10 Next ›