Good Papers

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation

MLorc compresses optimizer momentum via low-rank reconstruction to enable memory-efficient full-parameter LLM fine-tuning that matches full fine-tuning performance at small ranks.

Shen, Wei, Zhang Yaxiang, Minhui Huang, Minghan Xu, Jiawei Zhang, Cong Shen

Published Jun 2, 2025arXiv ↗

78%
OverallHighly rated
?
OverallHighly ratedVote to see the score
Readers
–

Only vote on papers you've read. Sign in to vote.

AI panel11/20reviewers recommend it
lenient 5/5
medium 6/10
strict 0/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

With increasing size of large language models (LLMs), full-parameter fine-tuning imposes substantial memory demands. To alleviate this, we propose a novel memory-efficient training paradigm called Momentum Low-rank compression (MLorc). The key idea of MLorc is to compress and reconstruct the momentum of matrix parameters during training to reduce memory consumption. Compared to LoRA, MLorc avoids enforcing a fixed-rank constraint on weight update matrices and thus enables full-parameter learning. Compared to GaLore, MLorc directly compress the momentum rather than gradients, thereby better preserving the training dynamics of full-parameter fine-tuning. We provide a theoretical guarantee for its convergence under mild assumptions. Empirically, MLorc consistently outperforms other memory-efficient training methods, matches or even exceeds the performance of full fine-tuning at small ranks (e.g., $r=4$), and generalizes well across different optimizers, all while not compromising time or memory efficiency.