MoRA: High-Rank Updating for Parameter-Efficient Fine-Tuning
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Universal Reasoner: A Single, Composable Plug-and-Play Reasoner for Frozen LLMs
Uni-LoRA: One Vector is All You Need
OSoRA: Output-Dimension and Singular-Value Initialized Low-Rank Adaptation
Reasoning on a Budget: Miniaturizing DeepSeek R1 with SFT-GRPO Alignment for Instruction-Tuned LLMs
Parameter-Efficient Checkpoint Merging via Metrics-Weighted Averaging
Optimizing Anytime Reasoning via Budget Relative Policy Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.