PeriodicLoRA: Breaking the Low-Rank Bottleneck in LoRA Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917597620994048 |
|---|---|
| author | Meng, Xiangdi Dai, Damai Luo, Weiyao Yang, Zhe Wu, Shaoxiang Wang, Xiaochen Wang, Peiyi Dong, Qingxiu Chen, Liang Sui, Zhifang |
| author_facet | Meng, Xiangdi Dai, Damai Luo, Weiyao Yang, Zhe Wu, Shaoxiang Wang, Xiaochen Wang, Peiyi Dong, Qingxiu Chen, Liang Sui, Zhifang |
| contents | Supervised fine-tuning is the most common method to adapt large language models (LLMs) to downstream tasks, but full fine-tuning LLMs requires massive computational resources. Recently, parameter-efficient fine-tuning (PEFT) methods have been widely studied due to its cost-effectiveness. LoRA is one of the most widely used methods, which assumes that the optimization process is essentially low-dimensional. Although LoRA fine-tuning is effective, there is still a performance gap compared to full fine-tuning, since its weight update is limited to low-rank matrices. In order to break the low-rank bottleneck in LoRA Optimization, we propose PeriodicLoRA (PLoRA), which accumulates low-rank update matrices multiple times to achieve a higher update rank. PLoRA has multiple training stages. During each stage, we still update only the LoRA weights. However, at the end of each stage, we unload the LoRA weights into the backbone parameters and then reinitialize the LoRA states. Experimental results show that PLoRA has stronger learning ability, approximately 1.8 times that of LoRA's learning ability at most, but it does not increase memory usage. Further, we introduce a momentum-based unloading strategy for PLoRA to mitigate the training instability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_16141 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | PeriodicLoRA: Breaking the Low-Rank Bottleneck in LoRA Optimization Meng, Xiangdi Dai, Damai Luo, Weiyao Yang, Zhe Wu, Shaoxiang Wang, Xiaochen Wang, Peiyi Dong, Qingxiu Chen, Liang Sui, Zhifang Computation and Language Supervised fine-tuning is the most common method to adapt large language models (LLMs) to downstream tasks, but full fine-tuning LLMs requires massive computational resources. Recently, parameter-efficient fine-tuning (PEFT) methods have been widely studied due to its cost-effectiveness. LoRA is one of the most widely used methods, which assumes that the optimization process is essentially low-dimensional. Although LoRA fine-tuning is effective, there is still a performance gap compared to full fine-tuning, since its weight update is limited to low-rank matrices. In order to break the low-rank bottleneck in LoRA Optimization, we propose PeriodicLoRA (PLoRA), which accumulates low-rank update matrices multiple times to achieve a higher update rank. PLoRA has multiple training stages. During each stage, we still update only the LoRA weights. However, at the end of each stage, we unload the LoRA weights into the backbone parameters and then reinitialize the LoRA states. Experimental results show that PLoRA has stronger learning ability, approximately 1.8 times that of LoRA's learning ability at most, but it does not increase memory usage. Further, we introduce a momentum-based unloading strategy for PLoRA to mitigate the training instability. |
| title | PeriodicLoRA: Breaking the Low-Rank Bottleneck in LoRA Optimization |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2402.16141 |