FOAM: Blocked State Folding for Memory-Efficient LLM Training
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have demonstrated remarkable performance due to their large parameter counts and extensive training data. However, their scale leads to significant memory bottlenecks during training, especially when using memory-intensive optimizers like Adam. Existing memory-efficient approaches often rely on techniques such as singular value decomposition (SVD), projections, or weight freezing, which can introduce substantial computational overhead, require additional memory for projections, or degrade model performance. In this paper, we propose Folded Optimizer with Approximate Moment (FOAM), a method that compresses optimizer states by computing block-wise gradient means and incorporates a residual correction to recover lost information. Theoretically, FOAM achieves convergence rates equivalent to vanilla Adam under standard non-convex optimization settings. Empirically, FOAM eliminates up to 90% of the memory overhead of optimizer states and accelerates convergence. Furthermore, FOAM is compatible with other memory-efficient optimizers, delivering performance and throughput that match or surpass both full-rank and existing memory-efficient baselines. Code is available at https://github.com/zqOuO/FOAM.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 42 of its 54 references that are in the map. First posted on arXiv 8 Dec 2025.
Builds on
42 of 54 references.
References · 42
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
30 more
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2025Gemma 3 Technical Reportcited by 1,824
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,554
- 2024LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Modelscited by 1,464
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
- 2018Neural Network Acceptability Judgmentscited by 958
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 906
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2016Training Deep Nets with Sublinear Memory Costcited by 848
- 2019On the Convergence of Adam and Beyondcited by 841
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2025Muon is Scalable for LLM Trainingcited by 428
- 20218-bit Optimizers via Block-wise Quantizationcited by 403
- 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
- 2025Training Deep Learning Models with Norm-Constrained LMOscited by 192
- 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 137
- 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 137
- 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 108
- 2018On the Convergence of Adaptive Gradient Methods for Nonconvex Optimizationcited by 91
- 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 82
- 2024APOLLO: SGD-like Memory, AdamW-level Performancecited by 54
- 2024Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?cited by 43
- 2024Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradientscited by 38
- 2024LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statisticscited by 38
- 2023Batched Low-Rank Adaptation of Foundation Modelscited by 32
- 2025The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Trainingcited by 30
- 2025SubTrack++ : Gradient Subspace Tracking for Scalable LLM Trainingcited by 16
- 2024BlockLLM: Memory-Efficient Adaptation of LLMs by Selecting and Optimizing the Right Coordinate Blockscited by 9
- 2025AdamS: Momentum Itself Can Be A Normalizer for LLM Pretraining and Post-trainingcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.