English
Related papers

Related papers: TRAWL: Tensor Reduced and Approximated Weights for…

200 papers

In the field of model compression, choosing an appropriate rank for tensor decomposition is pivotal for balancing model compression rate and efficiency. However, this selection, whether done manually or through optimization-based automatic…

Machine Learning · Computer Science 2025-09-17 Shiyi Luo , Mingshuo Liu , Yifeng Yu , Shangping Ren , Yu Bai

In recent years, Deep Learning models have shown a great performance in complex optimization problems. They generally require large training datasets, which is a limitation in most practical cases. Transfer learning allows importing the…

Neural and Evolutionary Computing · Computer Science 2024-02-06 Javier Poyatos , Daniel Molina , Aritz. D. Martinez , Javier Del Ser , Francisco Herrera

In this paper, we propose a highly parameter-efficient approach to scaling pre-trained language models (PLMs) to a deeper model depth. Unlike prior work that shares all parameters or uses extra blocks, we design a more capable…

Computation and Language · Computer Science 2023-04-12 Peiyu Liu , Ze-Feng Gao , Yushuo Chen , Wayne Xin Zhao , Ji-Rong Wen

Although large language models (LLMs) have achieved revolutionary breakthroughs in many fields, their large model size and high computational cost pose significant challenges for practical deployment on resource-constrained edge devices. To…

Machine Learning · Computer Science 2025-10-29 Yao Lu , Yuqi Li , Wenbin Xie , Shanqing Yu , Qi Xuan , Zhaowei Zhu , Shiping Wen

Magnitude pruning is a widely used strategy for reducing model size in pure supervised learning; however, it is less effective in the transfer learning regime that has become standard for state-of-the-art natural language processing…

Computation and Language · Computer Science 2020-10-26 Victor Sanh , Thomas Wolf , Alexander M. Rush

Transformer based large language models have achieved tremendous success. However, the significant memory and computational costs incurred during the inference process make it challenging to deploy large models on resource-constrained…

Computation and Language · Computer Science 2024-02-16 Wenxiao Wang , Wei Chen , Yicong Luo , Yongliu Long , Zhengkai Lin , Liye Zhang , Binbin Lin , Deng Cai , Xiaofei He

The extensive application of Large Language Models (LLMs) in generative coding tasks has raised concerns due to their high computational demands and energy consumption. Unlike previous structural pruning methods designed for classification…

Software Engineering · Computer Science 2025-04-25 Guang Yang , Yu Zhou , Xiangyu Zhang , Wei Cheng , Ke Liu , Xiang Chen , Terry Yue Zhuo , Taolue Chen

We introduce Probe Pruning (PP), a novel framework for online, dynamic, structured pruning of Large Language Models (LLMs) applied in a batch-wise manner. PP leverages the insight that not all samples and tokens contribute equally to the…

Computation and Language · Computer Science 2025-02-24 Qi Le , Enmao Diao , Ziyan Wang , Xinran Wang , Jie Ding , Li Yang , Ali Anwar

Neural Machine Translation (NMT), like many other deep learning domains, typically suffers from over-parameterization, resulting in large storage sizes. This paper examines three simple magnitude-based pruning schemes to compress NMT…

Artificial Intelligence · Computer Science 2016-07-01 Abigail See , Minh-Thang Luong , Christopher D. Manning

Understanding and shaping the behaviour of Large Language Models (LLMs) is increasingly important as applications become more powerful and more frequently adopted. This paper introduces a machine unlearning method specifically designed for…

Machine Learning · Computer Science 2024-07-25 Nicholas Pochinkov , Nandi Schoots

Model compression has been introduced to reduce the required hardware resources while maintaining the model accuracy. Lots of techniques for model compression, such as pruning, quantization, and low-rank approximation, have been suggested…

Machine Learning · Computer Science 2018-10-31 Dongsoo Lee , Parichay Kapoor , Byeongwook Kim

Large Language Models (LLMs) typically come with a fixed architecture, despite growing evidence that not all layers contribute equally to every downstream task. We introduce TALE (Task-Aware Layer Elimination), an inference-time method that…

Machine Learning · Computer Science 2026-05-12 Omar Naim , Krish Sharma , Niyar R Barman , Nicholas Asher

The rapid increase in the size of large language models (LLMs) has significantly escalated their computational and memory demands, posing challenges for efficient deployment, especially on resource-constrained devices. Structured pruning…

Machine Learning · Computer Science 2025-01-17 Hanyu Hu , Pengxiang Zhao , Ping Li , Yi Zheng , Zhefeng Wang , Xiaoming Yuan

Structured pruning is a promising hardware-friendly compression technique for large language models (LLMs), which is expected to be retraining-free to avoid the enormous retraining cost. This retraining-free paradigm involves (1) pruning…

Machine Learning · Computer Science 2024-07-19 Pingjie Wang , Ziqing Fan , Shengchao Hu , Zhe Chen , Yanfeng Wang , Yu Wang

Transformer-based NLP models are trained using hundreds of millions or even billions of parameters, limiting their applicability in computationally constrained environments. While the number of parameters generally correlates with…

Computation and Language · Computer Science 2022-08-16 Hassan Sajjad , Fahim Dalvi , Nadir Durrani , Preslav Nakov

To remove redundant components of large language models (LLMs) without incurring significant computational costs, this work focuses on single-shot pruning without a retraining phase. We simplify the pruning process for Transformer-based…

Artificial Intelligence · Computer Science 2024-07-30 Jianwei Li , Yijun Dong , Qi Lei

Existing works on large language model (LLM) decomposition mainly focus on improving performance on downstream tasks, but they ignore the poor parallel inference performance when trying to scale up the model size. To mitigate this important…

Computation and Language · Computer Science 2026-04-21 You-Liang Huang , Xinhao Huang , Chengxi Liao , Zeyi Wen

Large language models (LLMs) targeting different deployment scales and sizes are currently produced by training each variant from scratch; this is extremely compute-intensive. In this paper, we investigate if pruning an existing LLM and…

Large language models (LLMs) face significant deployment challenges due to their massive computational demands. % While pruning offers a promising compression solution, existing methods suffer from two critical limitations: (1) They neglect…

Machine Learning · Computer Science 2026-04-01 Lang Xiong , Ning Liu , Ao Ren , Yuheng Bai , Haining Fang , BinYan Zhang , Zhe Jiang , Yujuan Tan , Duo Liu

Large language models (LLMs) excel at language understanding and generation, but their enormous computational and memory requirements hinder deployment. Compression offers a potential solution to mitigate these constraints. However, most…

Machine Learning · Computer Science 2026-05-19 Huanrong Liu , Chunlin Tian , Xuyang Wei , Qingbiao Li , Li Li