English
Related papers

Related papers: ReDiPrune: Relevance-Diversity Pre-Projection Toke…

200 papers

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

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

Visual token pruning aims to compress and prune redundant visual tokens which play a critical role in efficient inference with large vision-language models (LVLMs). However, most existing work estimates visual redundancy using a single…

Computer Vision and Pattern Recognition · Computer Science 2025-11-20 Duo Li , Zuhao Yang , Xiaoqin Zhang , Ling Shao , Shijian Lu

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

Vision-language models (VLMs) have achieved impressive performance on multimodal reasoning tasks such as visual question answering, image captioning and so on, but their inference cost remains a significant challenge due to the large number…

Computer Vision and Pattern Recognition · Computer Science 2026-01-06 Weichen Zhang , Zhui Zhu , Ningbo Li , Shilong Tao , Kebin Liu , Yunhao Liu

Long-form video understanding remains challenging for Video Large Language Models (VideoLLMs), as the dense frame sampling introduces massive visual tokens while sparse sampling risks missing critical temporal evidence and leading to LLM…

Computer Vision and Pattern Recognition · Computer Science 2026-05-12 Jiameng Li , Minye Wu , Jiezhang Cao , Aleksei Tiulpin , Matthew B. Blaschko

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

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

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

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

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

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

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

Vision-language models (VLMs) face significant computational inefficiencies caused by excessive generation of visual tokens. While prior work shows that a large fraction of visual tokens are redundant, existing compression methods struggle…

Computer Vision and Pattern Recognition · Computer Science 2026-03-12 Zhengyao Fang , Pengyuan Lyu , Chengquan Zhang , Guangming Lu , Jun Yu , Wenjie Pei

Vision-language models (VLMs) have been widely adopted for 3D question answering (3D QA). In typical pipelines, visual tokens extracted from multiple viewpoints are concatenated with language tokens and jointly processed by a large language…

Computer Vision and Pattern Recognition · Computer Science 2026-04-01 Wenli Li , Kai Zhao , Haoran Jiang , Enquan Yang , Yi Su , Dan Zeng

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

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

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