English
Related papers

Related papers: A Free Lunch in LLM Compression: Revisiting Retrai…

200 papers

Pruning and quantization techniques have been broadly successful in reducing the number of parameters needed for large neural networks, yet theoretical justification for their empirical success falls short. We consider a randomized greedy…

Machine Learning · Computer Science 2025-12-09 Houssam El Cheairi , David Gamarnik , Rahul Mazumder

Pruning is an effective way to reduce the huge inference cost of Transformer models. However, prior work on pruning Transformers requires retraining the models. This can add high training cost and high complexity to model deployment, making…

Computation and Language · Computer Science 2022-10-18 Woosuk Kwon , Sehoon Kim , Michael W. Mahoney , Joseph Hassoun , Kurt Keutzer , Amir Gholami

Large Language Models (LLMs) have become pivotal in advancing the field of artificial intelligence, yet their immense sizes pose significant challenges for both fine-tuning and deployment. Current post-training pruning methods, while…

Computation and Language · Computer Science 2024-05-28 Xudong Lu , Aojun Zhou , Yuhui Xu , Renrui Zhang , Peng Gao , Hongsheng Li

Large language models (LLMs) have shown remarkable capabilities in language understanding and generation. However, such impressive capability typically comes with a substantial model size, which presents significant challenges in deployment…

Computation and Language · Computer Science 2025-06-26 Guinan Su , Li Shen , Lu Yin , Shiwei Liu , Yanwu Yang , Jonas Geiping

Modern deep networks have millions to billions of parameters, which leads to high memory and energy requirements during training as well as during inference on resource-constrained edge devices. Consequently, pruning techniques have been…

Machine Learning · Computer Science 2020-03-06 Sourjya Roy , Priyadarshini Panda , Gopalakrishnan Srinivasan , Anand Raghunathan

Low-rank adaptation (LoRA) and its variants have recently gained much interest due to their ability to avoid excessive inference costs. However, LoRA still encounters the following challenges: (1) Limitation of low-rank assumption; and (2)…

Computation and Language · Computer Science 2024-09-26 Qibin Wang , Xiaolin Hu , Weikai Xu , Wei Liu , Jian Luan , Bin Wang

Parameter-efficient fine-tuning (PEFT) of pre-trained language models (PLMs) has emerged as a highly successful approach, with training only a small number of parameters without sacrificing performance and becoming the de-facto learning…

Computation and Language · Computer Science 2023-10-20 Baohao Liao , Shaomu Tan , Christof Monz

A well-trained Convolutional Neural Network can easily be pruned without significant loss of performance. This is because of unnecessary overlap in the features captured by the network's filters. Innovations in network architecture such as…

Computer Vision and Pattern Recognition · Computer Science 2019-02-26 Aaditya Prakash , James Storer , Dinei Florencio , Cha Zhang

Large Language Models (LLMs) have demonstrated impressive reasoning capabilities, but their substantial size often demands significant computational resources. To reduce resource consumption and accelerate inference, it is essential to…

Machine Learning · Computer Science 2026-02-06 Yiran Zhao , Shengyang Zhou , Zijian Wu , Tongyan Hu , Yuhui Xu , Rengan Dou , Kenji Kawaguchi , Shafiq Joty , Junnan Li , Michael Qizhe Shieh

Network pruning focuses on algorithms that aim to reduce a given model's computational cost by removing a subset of its parameters while having minimal impact on performance. Throughout the last decade, the most widely used pruning paradigm…

Machine Learning · Computer Science 2025-11-11 Elia Cunegatti , Leonardo Lucio Custode , Giovanni Iacca

Parameter-efficient methods are able to use a single frozen pre-trained large language model (LLM) to perform many tasks by learning task-specific soft prompts that modulate model behavior when concatenated to the input text. However, these…

Computation and Language · Computer Science 2022-08-12 Brian Lester , Joshua Yurtsever , Siamak Shakeri , Noah Constant

The unstructured sparsity after pruning poses a challenge to the efficient implementation of deep learning models in existing regular architectures like systolic arrays. On the other hand, coarse-grained structured pruning is suitable for…

Machine Learning · Computer Science 2024-11-22 Xizi Chen , Jingyang Zhu , Jingbo Jiang , Chi-Ying Tsui

State-of-the-art language models are becoming increasingly large in an effort to achieve the highest performance on large corpora of available textual data. However, the sheer size of the Transformer architectures makes it difficult to…

Machine Learning · Computer Science 2024-03-22 Tycho F. A. van der Ouderaa , Markus Nagel , Mart van Baalen , Yuki M. Asano , Tijmen Blankevoort

Large language models (LLMs) are increasingly deployed as "agents" for decision-making (DM) in interactive and dynamic environments. Yet, since they were not originally designed for DM, recent studies show that LLMs can struggle even in…

Artificial Intelligence · Computer Science 2025-11-07 Chanwoo Park , Ziyang Chen , Asuman Ozdaglar , Kaiqing Zhang

Large Language Models (LLMs) now exhibit remarkable reasoning capabilities through test-time compute scaling (TTS), with impressive performance across math and coding benchmarks. In parallel, research in model compression has developed…

Artificial Intelligence · Computer Science 2026-05-29 Ocean Monjur , Shahriar Kabir Nahin , Anshuman Chhabra

Generalization abilities of well-trained large language models (LLMs) are known to scale predictably as a function of model size. In contrast to the existence of practical scaling laws governing pre-training, the quality of LLMs after…

Machine Learning · Computer Science 2024-12-09 Zifei Xu , Alexander Lan , Wanzin Yazar , Tristan Webb , Sayeh Sharify , Xin Wang

Large language models (LLMs) have shown impressive capabilities across various tasks. However, training LLMs from scratch requires significant computational power and extensive memory capacity. Recent studies have explored low-rank…

Machine Learning · Computer Science 2024-11-05 Andi Han , Jiaxiang Li , Wei Huang , Mingyi Hong , Akiko Takeda , Pratik Jawanpuria , Bamdev Mishra

Large language models (LLMs) have revolutionized natural language processing, albeit at the cost of immense memory and computation requirements. Post-training quantization (PTQ) is becoming the de facto method to reduce the memory footprint…

Machine Learning · Computer Science 2024-10-28 Yuhang Li , Priyadarshini Panda

Compressing large language models (LLMs), often consisting of billions of parameters, provides faster inference, smaller memory footprints, and enables local deployment. Two standard compression techniques are pruning and quantization, with…

Computation and Language · Computer Science 2023-12-05 Satya Sai Srinath Namburi , Makesh Sreedhar , Srinath Srinivasan , Frederic Sala

We introduce ReALLM, a novel approach for compression and memory-efficient adaptation of pre-trained language models that encompasses most of the post-training quantization and fine-tuning methods for a budget of <4 bits. Pre-trained…

Machine Learning · Computer Science 2024-05-24 Louis Leconte , Lisa Bedin , Van Minh Nguyen , Eric Moulines