English
Related papers

Related papers: AgilePruner: An Empirical Study of Attention and D…

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

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

Although Large Vision Language Models (LVLMs) have demonstrated remarkable performance in image understanding tasks, their computational efficiency remains a significant challenge, particularly on resource-constrained devices due to the…

Computer Vision and Pattern Recognition · Computer Science 2025-06-17 Ruiguang Pei , Weiqing Sun , Zhihui Fu , Jun Wang

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) typically encode substantially more visual tokens than text tokens, resulting in significant token redundancy. Pruning uninformative visual tokens is therefore crucial for improving computational efficiency,…

Computer Vision and Pattern Recognition · Computer Science 2026-01-19 Kai Zhao , Wubang Yuan , Yuchen Lin , Liting Ruan , Xiaofeng Lu , Deng-Ping Fan , Ming-Ming Cheng , Dan Zeng

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

Network pruning is an effective technique for enabling lightweight Large Vision-Language Models (LVLMs), which primarily incorporates both weights and activations into the importance metric. However, existing efforts typically process…

Computer Vision and Pattern Recognition · Computer Science 2026-03-18 Sijie Li , Biao Qian , Jungong Han

Despite achieving remarkable performance on various vision-language tasks, Transformer-based Vision-Language Models (VLMs) suffer from redundancy in inputs and parameters, significantly hampering their efficiency in real-world applications.…

Computation and Language · Computer Science 2024-02-27 Zekun Wang , Jingchang Chen , Wangchunshu Zhou , Haichao Zhu , Jiafeng Liang , Liping Shan , Ming Liu , Dongliang Xu , Qing Yang , Bing Qin

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

In multimodal large language models (MLLMs), the length of input visual tokens is often significantly greater than that of their textual counterparts, leading to a high inference cost. Many works aim to address this issue by removing…

Computer Vision and Pattern Recognition · Computer Science 2025-07-02 Qizhe Zhang , Mengzhen Liu , Lichen Li , Ming Lu , Yuan Zhang , Junwen Pan , Qi She , Shanghang 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

Large multimodal models (LMMs) often suffer from severe inference inefficiency due to the large number of visual tokens introduced by image encoders. While recent token compression methods, such as pruning and merging, have shown promise in…

Computer Vision and Pattern Recognition · Computer Science 2025-11-18 Tianfan Peng , Yuntao Du , Pengzhou Ji , Shijie Dong , Kailin Jiang , Mingchuan Ma , Yijun Tian , Jinhe Bi , Qian Li , Wei Du , Feng Xiao , Lizhen Cui

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

The established redundancy in visual tokens within large vision-language models allows pruning to effectively reduce their substantial computational demands. Previous methods typically employ heuristic layer-specific pruning strategies…

Computer Vision and Pattern Recognition · Computer Science 2025-10-07 Hanshi Wang , Yuhao Xu , Zekun Xu , Jin Gao , Yufan Liu , Weiming Hu , Ke Wang , Zhipeng Zhang

Vision-Language Models (VLMs) process thousands of visual tokens per image alongside comparatively few text tokens, yet existing compression methods treat both modalities uniformly. We observe that the two modalities have fundamentally…

Machine Learning · Computer Science 2026-05-29 Yilin Feng , Ahmed Burak Gulhan , Mahmut Taylan Kandemir

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

Multimodal Large Language Models (MLLMs) have achieved strong performance across vision-language tasks, but suffer from significant computational overhead due to the quadratic growth of attention computations with the number of multimodal…

Computer Vision and Pattern Recognition · Computer Science 2025-10-21 Yingqi Fan , Anhao Zhao , Jinlan Fu , Junlong Tong , Hui Su , Yijie Pan , Wei Zhang , Xiaoyu Shen

Vision-Language Models (VLMs) encode images and videos into abundant tokens, which contain substantial redundancy and computation cost. While visual token pruning mitigates the issue, most existing methods lack insight into the intrinsic…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Jizhihui Liu , Feiyi Du , Guangdao Zhu , Niu Lian , Jun Li , Bin Chen , Weili Guan , Yaowei Wang
‹ Prev 1 2 3 10 Next ›