English
Related papers

Related papers: RTPrune: Reading-Twice Inspired Token Pruning for …

200 papers

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

DeepSeek-OCR shows that rendered text can be reconstructed from a small number of vision tokens, sparking excitement about using vision as a compression medium for long textual contexts. But this pipeline requires rendering token embeddings…

Computer Vision and Pattern Recognition · Computer Science 2026-04-07 Ivan Yee Lee , Cheng Yang , Taylor Berg-Kirkpatrick

In Vision Language Models (VLMs), vision tokens are quantity-heavy yet information-dispersed compared with language tokens, thus consume too much unnecessary computation. Pruning redundant vision tokens for high VLM inference efficiency has…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Guangyuan Li , Rongzhen Zhao , Jinhong Deng , Yanbo Wang , Joni Pajarinen

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

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

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

Vision-language models (VLMs) often generate massive visual tokens that greatly increase inference latency and memory footprint; while training-free token pruning offers a practical remedy, existing methods still struggle to balance local…

Computer Vision and Pattern Recognition · Computer Science 2026-02-10 Enwei Tong , Yuanchao Bai , Yao Zhu , Junjun Jiang , Xianming Liu

Recent advancements in Vision-Language Models (VLMs) enable large language models (LLMs) to process high-resolution images, significantly improving real-world multimodal understanding. However, this capability introduces a large number of…

Computer Vision and Pattern Recognition · Computer Science 2026-05-12 Yuna Lee , Kyoungho Min , Yulhwa Kim

With the advancement of large-scale language modeling techniques, large multimodal models combining visual encoders with large language models have demonstrated exceptional performance in various visual tasks. Most of the current…

Computer Vision and Pattern Recognition · Computer Science 2024-12-20 Yi Chen , Jian Xu , Xu-Yao Zhang , Wen-Zhuo Liu , Yang-Yang Liu , Cheng-Lin Liu

Vision-Language Models suffer severe KV cache pressure at inference, as a single image often encodes into thousands of tokens. Most existing methods exploit token sparsity through token pruning, but permanently discarding visual content…

Computer Vision and Pattern Recognition · Computer Science 2026-05-20 Beomseok Kang , Dongwon Jo , Jiwon Song , Donghwee Son , Jae-Joon 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

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

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

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

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

Omni-modal large language models have demonstrated remarkable potential in holistic multimodal understanding; however, the token explosion caused by high-resolution audio and video inputs remains a critical bottleneck for real-time…

Artificial Intelligence · Computer Science 2026-05-15 Yeo Jeong Park , Hyemi Jang , Minseo Choi , Jongsun Lee , Jooyoung Choi , Yongkweon Jeon

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

Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Junzhu Mao , Yang Shen , Jinyang Guo , Yazhou Yao , Xiansheng Hua

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

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