English

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

Machine Learning 2026-04-28 v5 Information Theory math.IT Optimization and Control

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=4r=4), and generalizes well across different optimizers, all while not compromising time or memory efficiency.

Keywords

Cite

@article{arxiv.2506.01897,
  title  = {MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation},
  author = {Wei Shen and Zhang Yaxiang and Minhui Huang and Mengfan Xu and Jiawei Zhang and Cong Shen},
  journal= {arXiv preprint arXiv:2506.01897},
  year   = {2026}
}

Comments

AISTATS 2026

R2 v1 2026-07-01T02:54:51.906Z