GaLore (Gradient Low-Rank Projection)
Algorithms AIMech:GaLoreGradientLowRankProjectionForMemoryEfficientLlmTraining DRAFT
Aliases: GaLore, Gradient Low-Rank Projection, 8-bit GaLore
A memory-efficient full-parameter training strategy (Definitions 3.6 and Algorithm 2) for large language models and deep neural networks that projects each layer's full-rank weight gradient G_t = -nabla_W phi_t(W_t) in R^{m x n} (with m <= n) into a compact low-rank representation R_t = P_t^T G_t Q_t in R^{r x r} (or one-sided R_t = P_t^T G_t in R^{r x n} with r << m) using semi-orthogonal projection matrices P_t in R^{m x r}, Q_t in R^{n x r} obtained from the top-r singular vectors of G_t and refreshed every T iterations. GaLore tracks entry-wise stateful optimizer statistics (such as Adam's first and second moments M_t, V_t in R^{r x n}) exclusively on the projected gradient core R_t to form the normalized low-rank update N_t = rho_t(R_t) = hat{M}_t / (sqrt{hat{V}_t} + epsilon) and projects back to the original parameter space via tilde{G}_t = alpha P_t N_t Q_t^T (or alpha P_t N_t) to update the full-rank weight matrix W_t = W_{t-1} + eta tilde{G}_t, traversing a sequence of low-rank subspaces W_t = W_0 + Delta W_{T_1} + ... + Delta W_{T_k} to achieve full-rank learning with O(mn + mr + 2nr) memory.
Identity Notes & Concept Scope
Distinct from Low-Rank Adaptation (LoRA, AIMech:LowRankAdaptation) and ReLoRA, which reparameterize the weight matrix itself as W = W_0 + B A (restricting updates within each phase to a bilinear product B A that alters gradient dynamics and requires mn + 3mr + 3nr memory). GaLore keeps W_t as a single full-rank m x n matrix, never introduces bilinear adaptor factors B A, and reduces optimizer-state memory by projecting the gradient G_t before applying stateful regularizers rho_t.
Claims & Grounded Evidence
4 Claims
Mechanism
#exponential-decay-of-gradient-stable-rank-in-reversible-and-transformer-networks
Theorem 3.2 and Lemma 3.3 (Equations 6-9, Appendix B.1-B.2) prove that for chained reversible networks whose layer gradients follow the parametric form G_t = (1/N) sum_{i=1}^N (A_i - B_i W_t C_i) with positive semidefinite B_i, C_i and Kronecker operator S = (1/N) sum_{i=1}^N (C_i^T otimes B_i) having two smallest distinct eigenvalues lambda_1 < lambda_2, the vectorized gradient satisfies g_t = (I - eta S) g_{t-1} and the stable rank sr(G_t) = ||G_t||_F^2 / ||G_t||_2^2 decays exponentially via sr(G_t) <= sr(G_{t_0}^||) + ((1 - eta lambda_2)/(1 - eta lambda_1))^{2(t - t_0)} ||G_{t_0} - G_{t_0}^|| ||_F^2 / ||G_{t_0}^|| ||_2^2.
Mechanism
#fixed-subspace-contraction-and-multi-subspace-full-rank-weight-composition
Theorem 3.8 (Equation 11, Appendix B.4) proves that under L_A, L_B, L_C Lipschitz continuity of A_i, B_i, C_i and bounded weights ||W_t||_F <= D, projected gradient descent in a fixed subspace R_t = P^T G_t Q contracts at the linear rate ||R_t||_F <= [1 - eta (kappa_{t-1} - L_A - 2 L_B L_C D^2)] ||R_{t-1}||_F where kappa_t = (1/N) sum_i lambda_min(P^T B_{it} P) lambda_min(Q^T C_{it} Q), while periodic SVD re-initialization every T steps (Equation 14) accumulates W_t = W_0 + sum_k Delta W_{T_k} across distinct rank-r subspaces to learn full-rank weights.
Application
#sublinear-optimizer-state-memory-and-8bit-per-layer-llm-pretraining
For an m x n weight matrix with m <= n and rank r, one-sided GaLore (Algorithm 2, Table 1) stores W_t in R^{m x n}, P_t in R^{m x r}, and Adam moments M_t, V_t in R^{r x n} for a total of mn + mr + 2nr parameters (strictly smaller than LoRA's mn + 3mr + 3nr and full-rank Adam's 3mn), reducing optimizer state memory by up to 65.5% (BF16 GaLore) and 82.5% (8-bit GaLore) during LLaMA 1B and 7B pre-training on C4.
Limitation
#periodic-svd-computation-and-subspace-switching-frequency-tradeoff
GaLore incurs periodic SVD computation overhead every T steps to update the projection matrix P_t (inducing ~8.8%-17% throughput overhead on LLaMA 1B), and switching subspaces either too frequently (which corrupts accumulated momentum/variance fidelity in M_t, V_t) or too infrequently (which stalls optimization in a stale rank-r subspace) degrades convergence.
⚠️ Curated Limitations & Negative Results
- Requires computing a truncated SVD on each projected layer's gradient matrix every T iterations.
- Maintaining existing low-rank moments M_t, V_t across subspace switches introduces a tradeoff in the switching period T.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:ArtificialNeuralNetwork
Artificial Neural Network
|
related_match | GaLore is a memory-efficient full-parameter optimization strategy for pre-training and fine-tuning deep artificial neural networks and large language models. |
AIO:DimensionalityReduction
Dimensionality Reduction
|
related_match | Projects high-dimensional m x n weight gradient matrices into compact rank-r SVD subspaces to compress stateful optimizer statistics. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r584-primary-pdf
|
Jiawei Zhao, Zhenyu Zhang, Beidi Chen, Zhangyang Wang, Anima Anandkumar, Yuandong Tian
|
primary paper
full_text
|
ID: https://dblp.org/search/publ/api?q=GaLore+Memory-Efficient+LLM+Training+by+Gradient+Low-Rank+Projection&format=json
sha256:5179e9c9b083…
|
r584-arxiv-abs
|
Jiawei Zhao, Zhenyu Zhang, Beidi Chen, Zhangyang Wang, Anima Anandkumar, Yuandong Tian
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2403.03507
sha256:32f219e3e4f2…
|
r584-metadata-cr
|
Jiawei Zhao, Zhenyu Zhang, Beidi Chen, Zhangyang Wang, Anima Anandkumar, Yuandong Tian
|
primary paper
abstract_only
|
ID: https://dblp.org/search/publ/api?q=GaLore+Memory-Efficient+LLM+Training+by+Gradient+Low-Rank+Projection&format=json
sha256:08e124f3ed83…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T11:07:00Z
Updated: 2026-10-19T11:07: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