The Expressive Power of Low-Rank Adaptation

Low-Rank Adaptation (LoRA), a parameter-efficient fine-tuning method that leverages low-rank adaptation of weight matrices, has emerged as a prevalent technique for fine-tuning pre-trained models such as large language models and diffusion models. Despite its huge success in practice, the theoretica...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Zeng, Yuchen, Lee, Kangwook
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 18.03.2024
Subjects
Adaptation
Large language models
Neural networks
Online AccessGet full text

Cover

More Information
Summary:Low-Rank Adaptation (LoRA), a parameter-efficient fine-tuning method that leverages low-rank adaptation of weight matrices, has emerged as a prevalent technique for fine-tuning pre-trained models such as large language models and diffusion models. Despite its huge success in practice, the theoretical underpinnings of LoRA have largely remained unexplored. This paper takes the first step to bridge this gap by theoretically analyzing the expressive power of LoRA. We prove that, for fully connected neural networks, LoRA can adapt any model \(f\) to accurately represent any smaller target model \(\overline{f}\) if LoRA-rank \(\geq(\text{width of }f) \times \frac{\text{depth of }\overline{f}}{\text{depth of }f}\). We also quantify the approximation error when LoRA-rank is lower than the threshold. For Transformer networks, we show any model can be adapted to a target model of the same size with rank-\((\frac{\text{embedding size}}{2})\) LoRA adapters.
ISSN:2331-8422