English
Related papers

Related papers: Leveraging KV Similarity for Online Structured Pru…

200 papers

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

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

Non-uniform structured network pruning methods can effectively reduce Large Language Model (LLM) size by eliminating redundant channels or layers, offering lower performance degradation than uniform strategies. However, existing non-uniform…

Machine Learning · Computer Science 2025-08-07 Zuxin Ma , Yunhe Cui , Yongbin Qin

Although Large Vision-Language Models (LVLMs) have achieved impressive results, their high computational costs pose a significant barrier to wide application. To enhance inference efficiency, most existing approaches can be categorized as…

Computer Vision and Pattern Recognition · Computer Science 2025-08-01 Wei Suo , Ji Ma , Mengyang Sun , Lin Yuanbo Wu , Peng Wang , Yanning Zhang

While specialized Medical Vision-Language Models (VLMs) have achieved remarkable success in interpreting 2D and 3D medical modalities, their deployment for 3D volumetric data remains constrained by significant computational inefficiencies.…

Computer Vision and Pattern Recognition · Computer Science 2026-03-13 Shengyuan Liu , Zanting Ye , Yunrui Lin , Chen Hu , Wanting Geng , Xu Han , Bulat Ibragimov , Yefeng Zheng , Yixuan Yuan

Multimodal Large Language Models (MLLMs) suffer from substantial computational overhead due to the high redundancy in visual token sequences. Existing approaches typically address this issue using single-layer Vision Transformer (ViT)…

Computer Vision and Pattern Recognition · Computer Science 2026-04-15 Yunkai Dang , Yizhu Jiang , Yifan Jiang , Qi Fan , Yinghuan Shi , Wenbin Li , Yang Gao

Large Language Models (LLMs) have excelled in various tasks but perform better in high-resource scenarios, which presents challenges in low-resource scenarios. Data scarcity and the inherent difficulty of adapting LLMs to specific tasks…

Computation and Language · Computer Science 2024-04-02 Yuanhao Zeng , Min Wang , Yihang Wang , Yingxia Shao

Despite the remarkable success of Large Language Models (LLMs), the massive size poses significant deployment challenges, particularly on resource-constrained hardware. While existing LLM compression methods focus on quantization, pruning…

Artificial Intelligence · Computer Science 2023-10-12 Song Guo , Jiahang Xu , Li Lyna Zhang , Mao Yang

The rise of large language models (LLMs) has significantly advanced various natural language processing (NLP) tasks. However, the resource demands of these models pose substantial challenges. Structured pruning is an effective approach to…

Machine Learning · Computer Science 2024-12-17 Changhai Zhou , Yuhua Zhou , Shijie Han , Qian Qiao , Hongguang Li

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

With the development of pre-trained language models, the dense retrieval models have become promising alternatives to the traditional retrieval models that rely on exact match and sparse bag-of-words representations. Different from most…

Information Retrieval · Computer Science 2024-03-21 Qi Liu , Gang Guo , Jiaxin Mao , Zhicheng Dou , Ji-Rong Wen , Hao Jiang , Xinyu Zhang , Zhao Cao

Parallel reasoning enhances Large Reasoning Models (LRMs) but incurs prohibitive costs due to futile paths caused by early errors. To mitigate this, path pruning at the prefix level is essential, yet existing research remains fragmented…

Computation and Language · Computer Science 2026-04-20 Jiaxi Bi , Tongxu Luo , Wenyu Du , Zhengyang Tang , Benyou Wang

Pruning is an effective method for compressing Large Language Models, but finding an optimal, non-uniform layer-wise sparsity allocation remains a key challenge. While heuristic methods are fast but yield suboptimal performance, more…

Machine Learning · Computer Science 2025-11-25 Xin Yuan , Siqi Li , Jiateng Wei , Chengrui Zhu , Yanming Wu , Qingpeng Li , Jiajun Lv , Xiaoke Lan , Jun Chen , Yong Liu

Visual token pruning is a widely used strategy for efficient inference in multimodal large language models (MLLMs), but existing work mainly evaluates it with task accuracy. In this paper, we study how visual token pruning affects model…

Computer Vision and Pattern Recognition · Computer Science 2026-04-15 Kaizhen Tan

Large language models (LLMs) are known for their exceptional performance across a range of natural language processing tasks, but their deployment comes at a high computational and financial cost. On the other hand, smaller language models…

Computation and Language · Computer Science 2024-09-24 Adarsh MS , Jithin VG , Ditto PS

N:M structured pruning is essential for large language models (LLMs) because it can remove less important network weights and reduce the memory and computation requirements. Existing pruning methods mainly focus on designing metrics to…

Computation and Language · Computer Science 2025-03-17 Chi Xu , Gefei Zhang , Yantong Zhu , Luca Benini , Guosheng Hu , Yawei Li , Zhihong 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

Deploying transformer models in practice is challenging due to their inference cost, which scales quadratically with input sequence length. To address this, we present a novel Learned Token Pruning (LTP) method which adaptively removes…

Computation and Language · Computer Science 2022-06-06 Sehoon Kim , Sheng Shen , David Thorsley , Amir Gholami , Woosuk Kwon , Joseph Hassoun , Kurt Keutzer

Vision-language models (VLMs) have shown remarkable success across various multi-modal tasks, yet large VLMs encounter significant efficiency challenges due to processing numerous visual tokens. A promising approach to accelerating large…

Computer Vision and Pattern Recognition · Computer Science 2024-12-06 Wangbo Zhao , Yizeng Han , Jiasheng Tang , Zhikai Li , Yibing Song , Kai Wang , Zhangyang Wang , Yang You

Large language models (LLMs) have achieved outstanding performance in natural language processing, but enormous model sizes and high computational costs limit their practical deployment. Structured pruning can effectively reduce the…

Computation and Language · Computer Science 2025-03-11 Jun Kong , Xinge Ma , Jin Wang , Xuejie Zhang