English
Related papers

Related papers: SLTrain: a sparse plus low-rank approach for param…

200 papers

We present a data-adaptive method for parameter-efficient fine-tuning of large neural networks. Standard low-rank adaptation methods improve efficiency by restricting each layer update to a fixed low-rank form, but this static…

Machine Learning · Computer Science 2026-05-12 Omatharv Bharat Vaidya , Connor T. Jerzak , Nhat Ho , Chandrajit Bajaj

Reranking is fundamental to information retrieval and retrieval-augmented generation, with recent Large Language Models (LLMs) significantly advancing reranking quality. Most current works rely on large-scale LLMs (>7B parameters),…

Information Retrieval · Computer Science 2026-04-17 Xianming Li , Aamir Shakir , Rui Huang , Tsz-fung Andrew Lee , Julius Lipp , Benjamin Clavié , Jing Li

As Large Language Models (LLMs) are frequently updated, LoRA weights trained on earlier versions quickly become obsolete. The conventional practice of retraining LoRA weights from scratch on the latest model is costly, time-consuming, and…

Machine Learning · Computer Science 2025-05-21 Yanan Li , Fanxu Meng , Muhan Zhang , Shiai Zhu , Shangguang Wang , Mengwei Xu

This study investigates the mechanisms and factors influencing memorization in fine-tuned large language models (LLMs), with a focus on the medical domain due to its privacy-sensitive nature. We examine how different aspects of the…

Computation and Language · Computer Science 2025-08-06 Danil Savine

While Multimodal Large Language Models (MLLMs) demonstrate impressive capabilities, their substantial computational and memory requirements pose significant barriers to practical deployment. Current parameter reduction techniques primarily…

Computation and Language · Computer Science 2025-07-29 Yiran Huang , Lukas Thede , Massimiliano Mancini , Wenjia Xu , Zeynep Akata

Low-rank adaptation (LoRA) is a predominant parameter-efficient finetuning method for adapting large language models (LLMs) to downstream tasks. Meanwhile, Compute-in-Memory (CIM) architectures demonstrate superior energy efficiency due to…

Computation and Language · Computer Science 2026-03-10 Taiqiang Wu , Chenchen Ding , Wenyong Zhou , Yuxin Cheng , Xincheng Feng , Shuqi Wang , Wendong Xu , Chufan Shi , Zhengwu Liu , Ngai Wong

With the rapid scaling of large language models (LLMs), serving numerous low-rank adaptations (LoRAs) concurrently has become increasingly impractical, leading to unaffordable costs and necessitating more parameter-efficient finetuning…

Machine Learning · Computer Science 2024-05-28 Sheng Wang , Boyang Xue , Jiacheng Ye , Jiyue Jiang , Liheng Chen , Lingpeng Kong , Chuan Wu

Large Language Models (LLMs) demonstrate exceptional reasoning abilities, enabling strong generalization across diverse tasks such as commonsense reasoning and instruction following. However, as LLMs scale, inference costs become…

Computation and Language · Computer Science 2025-02-06 Rhea Sanjay Sukthanker , Benedikt Staffler , Frank Hutter , Aaron Klein

Pre-trained Language Models (PLMs) can be accurately fine-tuned for downstream text processing tasks. Recently, researchers have introduced several parameter-efficient fine-tuning methods that optimize input prompts or adjust a small number…

Computation and Language · Computer Science 2024-06-07 Saeed Najafi , Alona Fyshe

Large language models (LLMs) are computationally intensive. The computation workload and the memory footprint grow quadratically with the dimension (layer width). Most of LLMs' parameters come from the linear layers of the transformer…

Machine Learning · Computer Science 2024-02-22 Xiao-Yang Liu , Jie Zhang , Guoxuan Wang , Weiqing Tong , Anwar Walid

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

Low-rank factorization is a popular model compression technique that minimizes the error $\delta$ between approximated and original weight matrices. Despite achieving performances close to the original models when $\delta$ is optimized, a…

Machine Learning · Computer Science 2025-12-24 Boyang Zhang , Daning Cheng , Yunquan Zhang , Fangming Liu , Jiake Tian

Structured sparsity has emerged as a popular model pruning technique, widely adopted in various architectures, including CNNs, Transformer models, and especially large language models (LLMs) in recent years. A promising direction to further…

Machine Learning · Computer Science 2026-02-02 Zekai Li , Ji Liu , Guanchen Li , Yixing Xu , Ziqiong Liu , Xuanwu Yin , Dong Li , Emad Barsoum

Large language models (LLMs) have demonstrated impressive capabilities across various tasks, but the billion-scale parameters pose deployment challenges. Although existing methods attempt to reduce the scale of LLMs, they require either…

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

State-of-the-art convolutional neural networks (CNNs) used in vision applications have large models with numerous weights. Training these models is very compute- and memory-resource intensive. Much research has been done on pruning or…

Machine Learning · Computer Science 2019-12-10 Sangkug Lym , Esha Choukse , Siavash Zangeneh , Wei Wen , Sujay Sanghavi , Mattan Erez

Although recent quantized Large Language Models (LLMs), such as BitNet, have paved the way for significant reduction in memory usage during deployment with binary or ternary weights, training these models still demands substantial memory…

Machine Learning · Computer Science 2025-10-13 Kaiyan Zhao , Tsuguchika Tabaru , Kenichi Kobayashi , Takumi Honda , Masafumi Yamazaki , Yoshimasa Tsuruoka

Large language models (LLMs) excel in language tasks, especially with supervised fine-tuning after pre-training. However, their substantial memory and computational requirements hinder practical applications. Structural pruning, which…

Machine Learning · Computer Science 2025-01-28 Yijiang Liu , Huanrui Yang , Youxin Chen , Rongyu Zhang , Miao Wang , Yuan Du , Li Du

Fine-tuning large pre-trained models on downstream tasks has been adopted in a variety of domains recently. However, it is costly to update the entire parameter set of large pre-trained models. Although recently proposed parameter-efficient…

Computation and Language · Computer Science 2022-11-01 Yi-Lin Sung , Jaemin Cho , Mohit Bansal

Parameter-efficient fine-tuning (PEFT) aims to adapt pre-trained vision models to downstream tasks. Among PEFT paradigms, sparse tuning achieves remarkable performance by adjusting only the weights most relevant to downstream tasks, rather…

Computer Vision and Pattern Recognition · Computer Science 2025-10-29 Shufan Shen , Junshu Sun , Shuhui Wang , Qingming Huang

Long Short-Term Memory (LSTM) has achieved state-of-the-art performances on a wide range of tasks. Its outstanding performance is guaranteed by the long-term memory ability which matches the sequential data perfectly and the gating…

Neural and Evolutionary Computing · Computer Science 2019-01-29 Shiwei Liu , Decebal Constantin Mocanu , Mykola Pechenizkiy