mlsanityData to 7 Oct 2026

Learning Rate Scaling across LoRA Ranks and Transfer to Full Finetuning

arXiv 2602.06204 ↗First posted 5 Feb 2026cs.LG cs.AI cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Low-Rank Adaptation (LoRA) is a standard tool for parameter-efficient finetuning of large models. While it induces a small memory footprint, its training dynamics can be surprisingly complex as they depend on several hyperparameters such as initialization, adapter rank, and learning rate. In particular, it is unclear how the optimal learning rate scales with adapter rank, which forces practitioners to re-tune the learning rate whenever the rank is changed. In this paper, we introduce Maximal-Update Adaptation (μA), a theoretical framework that characterizes how the "optimal" learning rate should scale with model width and adapter rank to produce stable, non-vanishing feature updates under standard configurations. μA is inspired from the Maximal-Update Parametrization (μP) in pretraining. Our analysis leverages techniques from hyperparameter transfer and reveals that the optimal learning rate exhibits different scaling patterns depending on initialization and LoRA scaling factor. Specifically, we identify two regimes: one where the optimal learning rate remains roughly invariant across ranks, and another where it scales inversely with rank. We further identify a configuration that allows learning rate transfer from LoRA to full finetuning, drastically reducing the cost of learning rate tuning for full finetuning. Experiments across language, vision, vision--language, image generation, and reinforcement learning tasks validate our scaling rules and show that learning rates tuned on LoRA transfer reliably to full finetuning.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 58 of its 85 references that are in the map. First posted on arXiv 5 Feb 2026.

Builds on

58 of 85 references.

References · 58

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  6. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  7. 2024The Llama 3 Herd of Modelscited by 14,192
  8. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  9. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  10. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  11. 2025Qwen3 Technical Reportcited by 8,195
  12. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
38 more
  1. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  2. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  3. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  4. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  5. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  6. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
  7. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  8. 2025Gemma 3 Technical Reportcited by 1,686
  9. 2025SigLIP 2: Multilingual Vision-Language Encoders with Improved Semantic Understanding, Localization, and Dense Featurescited by 1,127
  10. 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 988
  11. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  12. 2019Adversarial NLI: A New Benchmark for Natural Language Understandingcited by 798
  13. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
  14. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  15. 2017Learning multiple visual domains with residual adapterscited by 553
  16. 2021Datasets: A Community Library for Natural Language Processingcited by 526
  17. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 365
  18. 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
  19. 2024LoRA Learns Less and Forgets Lesscited by 313
  20. 2025OpenThoughts: Data Recipes for Reasoning Modelscited by 287
  21. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 231
  22. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 195
  23. 2020Feature Learning in Infinite-Width Neural Networkscited by 182
  24. 2020Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learningcited by 139
  25. 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 134
  26. 2024LoRA vs Full Fine-tuning: An Illusion of Equivalencecited by 102
  27. 2019On the Impact of the Activation Function on Deep Neural Networks Trainingcited by 101
  28. 2023The Expressive Power of Low-Rank Adaptationcited by 100
  29. 2023Tensor Programs VI: Feature Learning in Infinite-Depth Neural Networkscited by 94
  30. 2024LoRA-Pro: Are Low-Rank Adapters Properly Optimized?cited by 70
  31. 2023Parameter-Efficient Fine-Tuning without Introducing New Latencycited by 59
  32. 2024The Impact of Initialization on LoRA Finetuning Dynamicscited by 53
  33. 2024VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Bankscited by 52
  34. 2025Text-to-LoRA: Instant Transformer Adaptioncited by 50
  35. 2020Stable ResNetcited by 49
  36. 2023The Shaped Transformer: Attention Models in the Infinite Depth-and-Width Limitcited by 47
  37. 2023Deep Transformers without Shortcuts: Modifying Self-attention for Faithful Signal Propagationcited by 44
  38. 2024LoRA Done RITE: Robust Invariant Transformation Equilibration for LoRA Optimizationcited by 31

50 most cited of 58 All 58 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 8.

8 papers.