mlsanityData to 14 Oct 2026

Natural GaLore: Accelerating GaLore for memory-efficient LLM Training and Fine-tuning

arXiv 2410.16029 ↗First posted 21 Oct 2024cs.LG cs.MAcited by 4

Not on the map. Why?

Abstract (arXiv)

Training LLMs presents significant memory challenges due to growing size of data, weights, and optimizer states. Techniques such as data and model parallelism, gradient checkpointing, and offloading strategies address this issue but are often infeasible due to hardware constraints. To mitigate memory usage, alternative methods like Parameter-Efficient-Fine-Tuning (PEFT) and GaLore approximate weights or optimizer states. PEFT methods, such as LoRA, have gained popularity for fine-tuning LLMs, though they require a full-rank warm start. In contrast, GaLore allows full-parameter learning while being more memory-efficient. This work introduces Natural GaLore, a simple drop in replacement for AdamW, which efficiently applies the inverse Empirical Fisher Information Matrix to low-rank gradients using Woodbury's Identity. We demonstrate that incorporating second-order information speeds up optimization significantly, especially when the iteration budget is limited. Empirical pretraining on 60M, 130M, 350M, and 1.1B parameter Llama models on C4 data demonstrate significantly lower perplexity over GaLore without additional memory overhead. By fine-tuning RoBERTa on the GLUE benchmark using Natural GaLore, we demonstrate significant reduction in gap 86.05% vs 86.28% for full-finetuning. Furthermore, fine-tuning the TinyLlama 1.1B model for function calling using the TinyAgent framework shows that Natural GaLore achieving 83.09% accuracy on the TinyAgent dataset, significantly outperforms 16-bit LoRA at 80.06% and even surpasses GPT4-Turbo by 4%, all while using 30% less memory. All code to reproduce the results are available at: https://github.com/selfsupervised-ai/Natural-GaLore.git

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 23 of its 40 references that are in the map. First posted on arXiv 21 Oct 2024.

Builds on

23 of 40 references.

References · 23

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  5. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  6. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  7. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  8. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  9. 2020GLU Variants Improve Transformercited by 1,804
  10. 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
  11. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
  12. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,202
11 more
  1. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
  2. 2018Neural Network Acceptability Judgmentscited by 958
  3. 2016Training Deep Nets with Sublinear Memory Costcited by 848
  4. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  5. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  6. 2014New insights and perspectives on the natural gradient methodcited by 443
  7. 2022Delta Tuning: A Comprehensive Study of Parameter Efficient Methods for Pre-trained Language Modelscited by 180
  8. 2023An LLM Compiler for Parallel Function Callingcited by 179
  9. 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 136
  10. 2024TinyAgent: Function Calling at the Edgecited by 58
  11. 2022Theoretical analysis of the randomized subspace regularized Newton method for non-convex optimizationcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 1.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Parameter Efficiency Is Not Memory Efficiency: Rethinking Fine-Tuning for On-Device LLM Adaptation
  2. 2024GaLore+: Boosting Low-Rank Adaptation for LLMs with Cross-Head Projection
  3. 2025Memory-Efficient LLM Training by Various-Grained Low-Rank Projection of Gradients
  4. 2025Recover-to-Forget: Gradient Reconstruction from LoRA for Efficient LLM Unlearning
  5. 2024Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradients
  6. 2026FlashOptim: Optimizers for Memory-Efficient Training
  7. 2024SLIM: Let LLM Learn More and Forget Less with Soft LoRA and Identity Mixture
  8. 2026Techniques for Peak Memory Reduction for LoRA Fine-tuning of LLMs on Edge Devices