arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.02411cs.LG
收藏

Delta-LoRA:利用低秩矩阵的增量微调高秩参数

Delta-LoRA: Fine-Tuning High-Rank Parameters with the Delta of Low-Rank Matrices

The Chinese University of Hong Kong(香港中文大学);International Digital Economy Academy (IDEA)(国际数字经济研究院(IDEA))

Bojia Zi, Xianbiao Qi, Lingzhi Wang, Jianan Wang, Kam-Fai Wong, Lei Zhang

AI总结:

本文提出Delta-LoRA,一种通过利用低秩矩阵乘积的增量更新预训练权重的高秩参数微调方法,在保持与LoRA相当的计算成本下显著提升性能。

摘要:

本文提出Delta-LoRA,一种用于微调大型语言模型(LLMs)的新型参数高效方法。与LoRA及其他低秩适配方法(如AdaLoRA)不同,Delta-LoRA不仅更新低秩矩阵A和B,还通过利用两个低秩矩阵乘积的增量(A^(t+1)B^(t+1) - A^(t)B^(t))将学习传播到预训练权重W。该策略有效解决了低秩矩阵的增量更新不足以学习适合下游任务的表示这一局限。此外,由于W的更新无需计算W的梯度及存储其动量,Delta-LoRA在内存需求和计算成本上与LoRA相当。大量实验表明,Delta-LoRA显著优于现有低秩适配方法。我们进一步通过全面分析支持这些结果,强调Delta-LoRA的有效性。

英文摘要:

In this paper, we present Delta-LoRA, which is a novel parameter-efficient approach to fine-tune large language models (LLMs). In contrast to LoRA and other low-rank adaptation methods such as AdaLoRA, Delta-LoRA not only updates the low-rank matrices $\bA$ and $\bB$, but also propagate the learning to the pre-trained weights $\bW$ via updates utilizing the delta of the product of two low-rank matrices ($\bA^{(t+1)}\bB^{(t+1)} - \bA^{(t)}\bB^{(t)}$). Such a strategy effectively addresses the limitation that the incremental update of low-rank matrices is inadequate for learning representations capable for downstream tasks. Moreover, as the update of $\bW$ does not need to compute the gradients of $\bW$ and store their momentums, Delta-LoRA shares comparable memory requirements and computational costs with LoRA. Extensive experiments show that Delta-LoRA significantly outperforms existing low-rank adaptation methods. We further support these results with comprehensive analyses that underscore the effectiveness of Delta-LoRA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑