mlsanityData to 14 Oct 2026

FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training

arXiv 2411.07837 ↗First posted 12 Nov 2024cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

With the increase in the number of parameters in large language models, the process of pre-training and fine-tuning increasingly demands larger volumes of GPU memory. A significant portion of this memory is typically consumed by the optimizer state. To overcome this challenge, recent approaches such as low-rank adaptation (LoRA (Hu et al., 2021)), low-rank gradient projection (GaLore (Zhao et al., 2024)), and blockwise optimization (BAdam (Luo et al., 2024)) have been proposed. However, in all these algorithms, the textiteffective rank of the weight updates remains low-rank, which can lead to a substantial loss of information from the gradient. This loss can be critically important, especially during the pre-training stage. In this paper, we introduce textttFRUGAL (Full-Rank Updates with GrAdient spLitting), a new memory-efficient optimization framework. textttFRUGAL leverages gradient splitting to perform low-dimensional updates using advanced algorithms (such as Adam), while updates along the remaining directions are executed via state-free methods like SGD or signSGD (Bernstein et al., 2018). Our framework can be integrated with various low-rank update selection techniques, including GaLore and BAdam. We provide theoretical convergence guarantees for our framework when using SGDM for low-dimensional updates and SGD for state-free updates. Additionally, our method consistently outperforms concurrent approaches across various fixed memory budgets, achieving state-of-the-art results in pre-training and fine-tuning tasks while balancing memory efficiency and performance metrics.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 54 of its 70 references that are in the map. First posted on arXiv 12 Nov 2024.

Builds on

54 of 70 references.

References · 54

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2023GPT-4 Technical Reportcited by 18,396
  4. 2024The Llama 3 Herd of Modelscited by 14,715
  5. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  6. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  7. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  8. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  9. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  10. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  11. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  12. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
38 more
  1. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,984
  2. 2020GLU Variants Improve Transformercited by 1,804
  3. 2019Root Mean Square Layer Normalizationcited by 1,480
  4. 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
  5. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  6. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
  7. 2016Training Deep Nets with Sublinear Memory Costcited by 848
  8. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  9. 2024TinyLlama: An Open-Source Small Language Modelcited by 618
  10. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  11. 2023The Falcon Series of Open Language Modelscited by 535
  12. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  13. 2023Symbolic Discovery of Optimization Algorithmscited by 434
  14. 2023Harnessing the Power of LLMs in Practice: A Survey on ChatGPT and Beyondcited by 411
  15. 20218-bit Optimizers via Block-wise Quantizationcited by 403
  16. 2015Deep Learning with Limited Numerical Precisioncited by 376
  17. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  18. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
  19. 2024When Scaling Meets LLM Finetuning: The Effect of Data, Model and Finetuning Methodcited by 204
  20. 2023Beyond Chinchilla-Optimal: Accounting for Inference in Language Model Scaling Lawscited by 159
  21. 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
  22. 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 137
  23. 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
  24. 2020An Improved Analysis of Stochastic Gradient Descent with Momentumcited by 119
  25. 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
  26. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 108
  27. 2024LISA: Layerwise Importance Sampling for Memory-Efficient Large Language Model Fine-Tuningcited by 89
  28. 2023Stable and low-precision training for large-scale vision-language modelscited by 75
  29. 2023Memory Efficient Optimizers with 4-bit Statescited by 54
  30. 2023Toward Understanding Why Adam Converges Faster Than SGD for Transformerscited by 53
  31. 2024Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?cited by 43
  32. 2020The Geometry of Sign Gradient Descentcited by 41
  33. 2024Deconstructing What Makes a Good Optimizer for Language Modelscited by 41
  34. 2024Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradientscited by 38
  35. 2024LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statisticscited by 38
  36. 2022Rare Gems: Finding Lottery Tickets at Initializationcited by 34
  37. 2023Cuttlefish: Low-Rank Model Training without All the Tuningcited by 25
  38. 2013Distributed Coordinate Descent Method for Learning with Big Datacited by 23

50 most cited of 54 All 54 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 6.

10 papers.