LoRA+ (Asymmetric Learning Rate Low-Rank Adaptation)
Algorithms AIMech:LoraPlusEfficientLowRankAdaptationWithAsymmetricLearningRates DRAFT
Aliases: LoRA+, LoRA Plus, Asymmetric Learning Rate Low-Rank Adaptation, Width-Scaled LoRA+
LoRA+ is an optimization algorithm for Low-Rank Adaptation (LoRA) of large-width neural networks that sets distinct, asymmetrically scaled learning rates for the two low-rank adapter matrices A in R^{r x n} (initialized with variance Theta(n^{-1})) and B in R^{n x r} (initialized to zero) in W = W^* + (alpha / r) B A. Based on an infinite-width scaling analysis (n -> infinity with fixed rank r << n) showing that efficient feature learning—where both linear feature-update terms delta_t^1 = B_{t-1} Delta Z_A^t and delta_t^2 = Delta B_t Z_A^{t-1} are Theta(1) without exploding activations—requires eta_A = Theta(n^{-1}) and eta_B = Theta(1), LoRA+ enforces a fixed learning-rate ratio eta_B = lambda * eta_A with lambda >> 1 (typically lambda in [2^1, 2^4]) and tunes only the base learning rate eta_A at zero additional computational or memory cost.
Identity Notes & Concept Scope
Distinct from standard LoRA (Hu et al., 2022), which updates both A and B using the same learning rate eta_A = eta_B = eta and consequently suffers from inefficient feature learning in large-width models (where either delta_t^1 = o(1) or intermediate features explode as width n grows). Also distinct from structural LoRA reparameterizations such as DoRA (Liu et al., 2024) and PiSSA (Meng et al., 2024), which alter the forward-pass weight decomposition or SVD initialization rather than the relative optimizer step sizes eta_B / eta_A.
Claims & Grounded Evidence
4 Claims
Mechanism
#r654-claim-inefficiency-of-equal-learning-rates
In the infinite-width limit n -> infinity with fixed rank r << n, decomposing the step-t LoRA feature update Delta Z_B^t = delta_t^1 + delta_t^2 + delta_t^3 into linear updates delta_t^1 = B_{t-1} Delta Z_A^t and delta_t^2 = Delta B_t Z_A^{t-1} and multiplicative update delta_t^3 = Delta B_t Delta Z_A^t shows (Proposition 1 and Theorem 1) that any single learning rate eta_A = eta_B = Theta(n^c) cannot simultaneously satisfy stability (Z_A, Z_B = O(1)) and efficient feature learning (delta_t^1 = Theta(1) and delta_t^2 = Theta(1)).
Mechanism
#r654-claim-optimal-width-scaling-ratio
When training LoRA adapters with gradient descent (Proposition 2) or Adam-type normalized gradients where g_A^t Z = Theta(n) (Theorem 1), setting eta_A = Theta(n^{-1}) and eta_B = Theta(1)—so that the learning rate exponent sum satisfies gamma[eta_A] + gamma[eta_B] = -1 and eta_B / eta_A = Theta(n)—uniquely guarantees Z_A^t = O(1), Z_B^t = O(1), and delta_t^i = Theta(1) for all i in {1, 2, 3} and steps t > 1.
Application
#r654-claim-llm-finetuning-speedup-and-accuracy
Setting eta_B = lambda * eta_A with lambda > 1 (empirically lambda = 2^4 = 16 for RoBERTa/GPT-2 on GLUE and lambda in [2^1, 2^2] for LLaMA-7B on Flan-v2/MMLU) delivers 1%-2% test accuracy improvements and up to ~2x fine-tuning convergence speedup over standard LoRA (eta_B = eta_A) at identical per-step computational cost.
Limitation
#r654-claim-architecture-and-task-dependent-constant-limitation
Because the asymptotic scaling law eta_B / eta_A = Theta(n) leaves the constant prefactor in Theta(n) unspecified, the optimal finite-width ratio lambda = eta_B / eta_A varies across model architectures, initialization schemes (Init[1] vs. Init[2]), and task difficulty (e.g., lambda approx 2^4 for RoBERTa on MNLI versus lambda approx 2^1-2^2 for LLaMA-7B).
⚠️ Curated Limitations & Negative Results
- The asymptotic scaling rule eta_B / eta_A = Theta(n) does not determine the exact finite-width constant factor lambda, which depends on the pretrained model architecture, adapter initialization scheme, and downstream task difficulty.
- On ”easy” downstream tasks that require minimal feature adaptation (such as single-epoch MNLI on LLaMA-7B), setting lambda >> 1 provides negligible gain over standard equal learning rates eta_B = eta_A.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:ArtificialNeuralNetwork
Artificial Neural Network
|
related_match | LoRA+ derives infinite-width learning-rate scaling laws for low-rank fine-tuning of deep neural networks and large language models. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r654-primary-pdf
|
Soufiane Hayou, Nikhil Ghosh, Bin Yu
|
primary paper
full_text
|
ID: https://dblp.org/rec/conf/icml/HayouG024.html
sha256:ee93deb531da…
|
r654-arxiv-abs
|
Soufiane Hayou, Nikhil Ghosh, Bin Yu
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2402.12354
sha256:9d111adab605…
|
r654-metadata-cr
|
Soufiane Hayou, Nikhil Ghosh, Bin Yu
|
primary paper
abstract_only
|
ID: https://dblp.org/rec/conf/icml/HayouG024.html
sha256:27db33885dde…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T12:17:00Z
Updated: 2026-10-19T12:17:00Z
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories