English
Related papers

Related papers: Compositional Subspace Representation Fine-tuning …

200 papers

Catastrophic forgetting remains a major challenge when adapting large language models (LLMs) to new tasks or domains. Conventional fine-tuning often overwrites existing knowledge, causing performance degradation on original tasks. We…

Computation and Language · Computer Science 2025-01-08 Ayoub Ben Chaliah , Hela Dellagi

In this paper we generalize and extend an idea of low-rank adaptation (LoRA) of large language models (LLMs) based on Transformer architecture. Widely used LoRA-like methods of fine-tuning LLMs are based on matrix factorization of gradient…

Computation and Language · Computer Science 2024-02-06 Daniel Bershatsky , Daria Cherniuk , Talgat Daulbaev , Aleksandr Mikhalev , Ivan Oseledets

A primary function of back-propagation is to compute both the gradient of hidden representations and parameters for optimization with gradient descent. Training large models requires high computational costs due to their vast parameter…

Machine Learning · Computer Science 2024-04-23 Enmao Diao , Qi Le , Suya Wu , Xinran Wang , Ali Anwar , Jie Ding , Vahid Tarokh

While critical for alignment, Supervised Fine-Tuning (SFT) incurs the risk of catastrophic forgetting, yet the layer-wise emergence of instruction-following capabilities remains elusive. We investigate this mechanism via a comprehensive…

Machine Learning · Computer Science 2026-04-15 Qinghua Zhao , Xueling Gong , Xinyu Chen , Zhongfeng Kang , Xinlu Li

Large Language Models (LLMs) exhibit a significant "embodiment gap", where their text-based representations fail to align with human sensorimotor experiences. This study systematically investigates whether and how task-specific fine-tuning…

Computation and Language · Computer Science 2026-03-05 Minghua Wu , Javier Conde , Pedro Reviriego , Marc Brysbaert

Large Language Models (LLMs) enhanced with external contexts, such as through retrieval-augmented generation (RAG), often face challenges in handling imperfect evidence. They tend to over-rely on external knowledge, making them vulnerable…

Computation and Language · Computer Science 2025-02-25 Shenglai Zeng , Pengfei He , Kai Guo , Tianqi Zheng , Hanqing Lu , Yue Xing , Hui Liu

Fine-tuning large vision models (LVMs) and large language models (LLMs) under differentially private federated learning (DPFL) is hindered by a fundamental privacy-utility trade-off. Low-Rank Adaptation (LoRA), a promising…

Machine Learning · Computer Science 2026-04-21 Jin Liu , Yinbin Miao , Ning Xi , Junkang Liu

Large language models (LLMs) acquire substantial world knowledge during pre-training, which is further shaped by post-training techniques such as supervised fine-tuning (SFT). However, the impact of SFT on a model's knowledge remains…

Computation and Language · Computer Science 2026-02-11 Junjie Ye , Yuming Yang , Yang Nan , Shuo Li , Qi Zhang , Tao Gui , Xuanjing Huang , Peng Wang , Zhongchao Shi , Jianping Fan

Although supervised finetuning (SFT) has emerged as an essential technique to align large language models with humans, it is considered superficial, with style learning being its nature. At the same time, recent works indicate the…

Computation and Language · Computer Science 2024-02-12 Ming Shen

Post-training of large language models involves a fundamental trade-off between supervised fine-tuning (SFT), which efficiently mimics demonstrations but tends to memorize, and reinforcement learning (RL), which achieves better…

Machine Learning · Computer Science 2026-02-03 He Zhu , Junyou Su , Peng Lai , Ren Ma , Wenjia Zhang , Linyi Yang , Guanhua Chen

Fine-tuning Large Language Models (LLMs) on specific datasets is a common practice to improve performance on target tasks. However, this performance gain often leads to overfitting, where the model becomes too specialized in either the task…

Computation and Language · Computer Science 2025-02-21 Sonam Gupta , Yatin Nandwani , Asaf Yehudai , Dinesh Khandelwal , Dinesh Raghu , Sachindra Joshi

Fine-tuning is a crucial process for adapting large language models (LLMs) to diverse applications. In certain scenarios, such as multi-tenant serving, deploying multiple LLMs becomes necessary to meet complex demands. Recent studies…

Computation and Language · Computer Science 2024-11-27 Bowen Ping , Shuo Wang , Hanqing Wang , Xu Han , Yuzhuang Xu , Yukun Yan , Yun Chen , Baobao Chang , Zhiyuan Liu , Maosong Sun

Parameter Recombination (PR) methods aim to efficiently compose the weights of a neural network for applications like Parameter-Efficient FineTuning (PEFT) and Model Compression (MC), among others. Most methods typically focus on one…

Computer Vision and Pattern Recognition · Computer Science 2026-04-14 Nazia Tasnim , Shrimai Prabhumoye , Bryan A. Plummer

Existing parameter-efficient fine-tuning (PEFT) methods for large language models (LLMs), such as LoRA and PiSSA, constrain model updates to low-rank subspaces, limiting their expressiveness and leading to suboptimal performance on complex…

Machine Learning · Computer Science 2025-09-29 Yiding Wang , Fauxu Meng , Xuefeng Zhang , Fan Jiang , Pingzhi Tang , Muhan Zhang

We present a new method for large language models to solve compositional tasks. Although they have shown strong performance on traditional language understanding tasks, large language models struggle to solve compositional tasks, where the…

Computation and Language · Computer Science 2024-07-09 Eric Pasewark , Kyle Montgomery , Kefei Duan , Dawn Song , Chenguang Wang

Low Rank Adaptation (LoRA) has emerged as one of the most widely adopted methods for Parameter Efficient Fine-Tuning (PEFT) of Large Language Models (LLMs). LoRA reduces the number of trainable parameters and memory usage while achieving…

Computation and Language · Computer Science 2024-05-03 Justin Zhao , Timothy Wang , Wael Abid , Geoffrey Angus , Arnav Garg , Jeffery Kinnison , Alex Sherstinsky , Piero Molino , Travis Addair , Devvret Rishi

We revisit continual learning~(CL), which enables pre-trained vision transformers (ViTs) to sequentially fine-tune on new downstream tasks over time. However, as the scale of these models increases, catastrophic forgetting remains a more…

Computer Vision and Pattern Recognition · Computer Science 2026-03-25 Huancheng Chen , Jingtao Li , Weiming Zhuang , Chen Chen , Lingjuan Lyu

Parameter-efficient fine-tuning (PEFT) is widely studied for its effectiveness and efficiency in the era of large language models. Low-rank adaptation (LoRA) has demonstrated commendable performance as a popular and representative method.…

Computation and Language · Computer Science 2024-04-16 Zequan Liu , Jiawen Lyn , Wei Zhu , Xing Tian , Yvette Graham

Among the widely used parameter-efficient fine-tuning (PEFT) methods, LoRA and its variants have gained considerable popularity because of avoiding additional inference costs. However, there still often exists an accuracy gap between these…

Computation and Language · Computer Science 2024-07-10 Shih-Yang Liu , Chien-Yi Wang , Hongxu Yin , Pavlo Molchanov , Yu-Chiang Frank Wang , Kwang-Ting Cheng , Min-Hung Chen

We study the computational limits of Low-Rank Adaptation (LoRA) for finetuning transformer-based models using fine-grained complexity theory. Our key observation is that the existence of low-rank decompositions within the gradient…

Machine Learning · Computer Science 2025-06-09 Jerry Yao-Chieh Hu , Maojiang Su , En-Jui Kuo , Zhao Song , Han Liu