about
MoRA: High-Rank Updating for Parameter-Efficient Fine-Tuning (arxiv.org)
3 points by jasondavies on May 25, 2024 | hide | past | pdf | discuss on HN

In plain words: Fine-tuning with a small flat update can limit how much new knowledge a model learns or memorizes. MoRA reshapes the same trainable numbers into a square update, storing more new information and beating the usual flat-update trick on memory-heavy tasks while matching it elsewhere.

Abstract

Low-rank adaptation is a popular parameter-efficient fine-tuning method for large language models. In this paper, we analyze the impact of low-rank updating, as implemented in LoRA. Our findings suggest that the low-rank updating mechanism may limit the ability of LLMs to effectively learn and memorize new knowledge. Inspired by this observation, we propose a new method called MoRA, which employs a square matrix to achieve high-rank updating while maintaining the same number of trainable parameters. To achieve it, we introduce the corresponding non-parameter operators to reduce the input dimension and increase the output dimension for the square matrix. Furthermore, these operators ensure that the weight can be merged back into LLMs, which makes our method can be deployed like LoRA. We perform a comprehensive evaluation of our method across five tasks: instruction tuning, mathematical reasoning, continual pretraining, memory and pretraining. Our method outperforms LoRA on memory-intensive tasks and achieves comparable performance on other tasks.

Ting Jiang, Shaohan Huang, Shengyue Luo, Zihan Zhang, Haizhen Huang, Furu Wei, Weiwei Deng, Feng Sun, Qi Zhang, Deqing Wang, Fuzhen Zhuang
arXiv:2405.12130 · cs.CL, cs.LG · submitted May 20, 2024
abstract · pdf · html · Work in Progress

add comment on HN
Also discussed: May 2024 (1 point, 0 comments)