English
Related papers

Related papers: FTP: A Fine-grained Token-wise Pruner for Large La…

200 papers

Large language models (LLMs) deliver impressive results but face challenges from increasing model sizes and computational costs. Structured pruning reduces model size and speeds up inference but often causes uneven degradation across…

Computation and Language · Computer Science 2025-05-28 Hexuan Deng , Wenxiang Jiao , Xuebo Liu , Jing Li , Min Zhang , Zhaopeng Tu

State-of-the-art results in large language models (LLMs) often rely on scale, which becomes computationally expensive. This has sparked a research agenda to reduce these models' parameter counts and computational costs without significantly…

Computation and Language · Computer Science 2024-11-07 Xiuying Wei , Skander Moalla , Razvan Pascanu , Caglar Gulcehre

With the rapid expansion of large language models (LLMs), the demand for memory and computational resources has grown significantly. Recent advances in LLM pruning aim to reduce the size and computational cost of these models. However,…

Machine Learning · Computer Science 2025-05-29 Zhendong Mi , Zhenglun Kong , Geng Yuan , Shaoyi Huang

Large language models (LLMs) have revolutionized Natural Language Processing (NLP), but their size creates computational bottlenecks. We introduce a novel approach to create accurate, sparse foundational versions of performant LLMs that…

Large Language Models (LLMs) pruning seeks to remove unimportant weights for inference speedup with minimal accuracy impact. However, existing methods often suffer from accuracy degradation without full-model sparsity-aware fine-tuning.…

Large Language Models (LLMs) are gaining significant popularity in recent years for specialized tasks using prompts due to their low computational cost. Standard methods like prefix tuning utilize special, modifiable tokens that lack…

Computation and Language · Computer Science 2024-10-14 Nusrat Jahan Prottasha , Asif Mahmud , Md. Shohanur Islam Sobuj , Prakash Bhat , Md Kowsher , Niloofar Yousefi , Ozlem Ozmen Garibay

Long-context inference enhances the reasoning capability of Large Language Models (LLMs), but incurs significant computational overhead. Token-oriented methods, such as pruning and skipping, have shown great promise in reducing inference…

Computation and Language · Computer Science 2026-02-03 Zimeng Wu , Donghao Wang , Chaozhe Jin , Jiaxin Chen , Yunhong Wang

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

Transformer-based pre-trained language models have significantly improved the performance of various natural language processing (NLP) tasks in the recent years. While effective and prevalent, these models are usually prohibitively large…

Computation and Language · Computer Science 2022-01-19 Dongkuan Xu , Ian E. H. Yen , Jinxi Zhao , Zhibin Xiao

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

Visual token pruning reduces the computational cost of Vision-Language Models (VLMs) by removing redundant visual tokens. Existing methods typically rely on Gumbel-Softmax to approximate discrete selection during training. However, the…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Landi He , Mingde Yao , Shawn Young , Lijian Xu

Token reduction accelerates Multimodal Large Language Models (MLLMs) by reducing excessive tokens, but overlooks structural redundancy differences, where critical and redundant modules process identical token loads. For fine-grained…

Machine Learning · Computer Science 2025-11-14 Aoming Liu , Reuben Tan , Boqing Gong , Bryan A. Plummer

Recent advances in large language models (LLMs) have enabled breakthroughs in many multimodal generation tasks, but a significant performance gap still exists in text-to-motion generation, where LLM-based methods lag far behind non-LLM…

Computer Vision and Pattern Recognition · Computer Science 2025-06-24 Chuhao Jin , Haosen Li , Bingzi Zhang , Che Liu , Xiting Wang , Ruihua Song , Wenbing Huang , Ying Qin , Fuzheng Zhang , Di Zhang

Large Language Models are growing in size, and we expect them to continue to do so, as larger models train quicker. However, this increase in size will severely impact inference costs. Therefore model compression is important, to retain the…

Machine Learning · Computer Science 2024-04-10 Georgy Tyukin

Considering the hardware-friendly characteristics and broad applicability, structured pruning has emerged as an efficient solution to reduce the resource demands of large language models (LLMs) on resource-constrained devices. Traditional…

Machine Learning · Computer Science 2025-01-28 Zihuai Xu , Yang Xu , Hongli Xu , Yunming Liao , Zhiwei Yao , Zuan Xie

Large Language Models (LLMs) have demonstrated their exceptional performance in various complex code generation tasks. However, their broader adoption is limited by significant computational demands and high resource requirements,…

Machine Learning · Computer Science 2025-01-10 Laura Puccioni , Alireza Farshin , Mariano Scazzariello , Changjie Wang , Marco Chiesa , Dejan Kostic

Large language models (LLMs) have demonstrated remarkable performance across a wide range of language processing tasks. However, this success comes at the cost of substantial computation and memory requirements, which significantly impedes…

Machine Learning · Computer Science 2026-01-21 Fen-Yu Hsieh , Yun-Chang Teng , Ding-Yong Hong , Jan-Jan Wu

Fine tuning has been regarded as a de facto approach for adapting large language models (LLMs) to downstream tasks, but the high training memory consumption inherited from LLMs makes this process inefficient. Among existing memory efficient…

Computation and Language · Computer Science 2026-01-28 Runjia Zeng , Qifan Wang , Qiang Guan , Ruixiang Tang , Lifu Huang , Zhenting Wang , Xueling Zhang , Cheng Han , Dongfang Liu

Multimodal Large Language Models (MLLMs) have demonstrated impressive capabilities, yet they encounter significant computational bottlenecks due to the massive volume of visual tokens. Consequently, visual token pruning, which substantially…

Computer Vision and Pattern Recognition · Computer Science 2026-02-17 Yifan Tan , Yifu Sun , Shirui Huang , Hong Liu , Guanghua Yu , Jianchen Zhu , Yangdong Deng

Despite the remarkable capabilities, Large Language Models (LLMs) face deployment challenges due to their extensive size. Pruning methods drop a subset of weights to accelerate, but many of them require retraining, which is prohibitively…

Machine Learning · Computer Science 2024-06-06 Peijie Dong , Lujun Li , Zhenheng Tang , Xiang Liu , Xinglin Pan , Qiang Wang , Xiaowen Chu