English
Related papers

Related papers: TransPrune: Token Transition Pruning for Efficient…

200 papers

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

Video Large Language Models (VLLMs) incur substantial prefilling cost due to the large number of visual tokens. While attention-based token pruning offers a promising acceleration strategy, applying it at shallow decoder layers often causes…

Computer Vision and Pattern Recognition · Computer Science 2026-03-17 Yingjie Xia , Tao Liu , Jinglei Shi , Qingsong Xie , Heng Guo , Jian Yang , Xi Wang

While 3D Multi-modal Large Language Models (MLLMs) demonstrate remarkable scene understanding capabilities, their practical deployment faces critical challenges due to computational inefficiency. The key bottleneck stems from processing…

Computer Vision and Pattern Recognition · Computer Science 2025-07-15 Wencan Huang , Daizong Liu , Wei Hu

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

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

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

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

Autoregressive Transformers adopted in Large Language Models (LLMs) are hard to scale to long sequences. Despite several works trying to reduce their computational cost, most of LLMs still adopt attention layers between all pairs of tokens…

Computation and Language · Computer Science 2024-06-03 Sotiris Anagnostidis , Dario Pavllo , Luca Biggio , Lorenzo Noci , Aurelien Lucchi , Thomas Hofmann

Large models achieve strong performance on Vision-and-Language Navigation (VLN) tasks, but are costly to run in resource-limited environments. Token pruning offers appealing tradeoffs for efficiency with minimal performance loss by reducing…

Computer Vision and Pattern Recognition · Computer Science 2025-09-23 Wenda Qin , Andrea Burns , Bryan A. Plummer , Margrit Betke

Multimodal Large Language Models (MLLMs) incur significant computational cost from processing numerous vision tokens through all LLM layers. Prior pruning methods operate either before the LLM, limiting generality due to diverse…

Computer Vision and Pattern Recognition · Computer Science 2026-02-16 Omer Faruk Deniz , Ruiyu Mao , Ruochen Li , Yapeng Tian , Latifur Khan

DeepSeek-OCR leverages visual-text compression to reduce long-text processing costs and accelerate inference, yet visual tokens remain prone to redundant textual and structural information. Moreover, current token pruning methods for…

Computer Vision and Pattern Recognition · Computer Science 2026-05-22 Ben Wan , Yan Feng , Zihan Tang , Weizhe Huang , Yuting Zeng , Jia Wang , Tongxuan Liu

Large Vision-Language Models (LVLMs) have demonstrated remarkable capabilities across a range of multimodal tasks. However, their inference efficiency is constrained by the large number of visual tokens processed during decoding. To address…

Computer Vision and Pattern Recognition · Computer Science 2025-02-21 Yu Meng , Kaiyuan Li , Chenran Huang , Chen Gao , Xinlei Chen , Yong Li , Xiaoping Zhang

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

Transformer-based models have driven significant advancements in Multimodal Large Language Models (MLLMs), yet their computational costs surge drastically when scaling resolution, training data, and model parameters. A key bottleneck stems…

Computer Vision and Pattern Recognition · Computer Science 2025-07-04 Weili Zeng , Ziyuan Huang , Kaixiang Ji , Yichao Yan

While excellent in transfer learning, Vision-Language models (VLMs) come with high computational costs due to their large number of parameters. To address this issue, removing parameters via model pruning is a viable solution. However,…

Computer Vision and Pattern Recognition · Computer Science 2024-04-09 Matteo Farina , Massimiliano Mancini , Elia Cunegatti , Gaowen Liu , Giovanni Iacca , Elisa Ricci

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

Pruning has emerged as a promising direction for accelerating large language model (LLM) inference, yet existing approaches often suffer from instability because they rely on offline calibration data that may not generalize across inputs.…

Computation and Language · Computer Science 2025-12-09 Jungmin Lee , Gwangeun Byeon , Yulhwa Kim , Seokin Hong

Vision language models (VLMs) demonstrate strong capabilities in jointly processing visual and textual data. However, they often incur substantial computational overhead due to redundant visual information, particularly in long-form video…

Machine Learning · Computer Science 2025-04-25 Yudong Liu , Jingwei Sun , Yueqian Lin , Jingyang Zhang , Ming Yin , Qinsi Wang , Jianyi Zhang , Hai Li , Yiran Chen

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

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