English
Related papers

Related papers: ZSPAPrune: Zero-Shot Prompt-Aware Token Pruning fo…

200 papers

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

Large Vision Language Models (LVLMs) have been widely adopted to guide vision foundation models in performing reasoning segmentation tasks, achieving impressive performance. However, the substantial computational overhead associated with…

Computer Vision and Pattern Recognition · Computer Science 2025-04-16 Hanning Chen , Yang Ni , Wenjun Huang , Hyunwoo Oh , Yezi Liu , Tamoghno Das , Mohsen Imani

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

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

Recent progress in vision-language models (VLMs) has led to impressive results in document understanding tasks, but their high computational demands remain a challenge. To mitigate the compute burdens, we propose a lightweight token pruning…

Computer Vision and Pattern Recognition · Computer Science 2026-03-05 Jaemin Son , Sujin Choi , Inyong Yun

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

Online video understanding is essential for applications like public surveillance and AI glasses. However, applying Multimodal Large Language Models (MLLMs) to this domain is challenging due to the large number of video frames, resulting in…

Computer Vision and Pattern Recognition · Computer Science 2025-12-16 Xinqi Jin , Hanxun Yu , Bohan Yu , Kebin Liu , Jian Liu , Keda Tao , Yixuan Pei , Huan Wang , Fan Dang , Jiangchuan Liu , Weiqiang Wang

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

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

Visual tokens dominate inference cost in vision-language models (VLMs), yet many carry redundant information. Existing pruning methods alleviate this but typically rely on attention magnitude or similarity scores. We reformulate visual…

Computer Vision and Pattern Recognition · Computer Science 2026-03-10 Landi He , Xiaoyu Yang , Lijian Xu

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

Multi-modal Large Langue Models (MLLMs) often process thousands of visual tokens, which consume a significant portion of the context window and impose a substantial computational burden. Prior work has empirically explored visual token…

Computer Vision and Pattern Recognition · Computer Science 2025-03-27 Dingchen Yang , Bowen Cao , Anran Zhang , Weibo Gu , Winston Hu , Guang Chen

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

In Vision-Language Models (VLMs), processing a massive number of visual tokens incurs prohibitive computational overhead. While recent training-aware pruning methods attempt to selectively discard redundant tokens, they largely rely on…

Computer Vision and Pattern Recognition · Computer Science 2026-05-14 Mingzhe Huang , Weijun Wang , Xin Ding , Liang Mi , Hao Wen , Yuanchun Li , Lichen Pang , Shansong Yang , Yunxin Liu , Ting Cao

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