mlsanityData to 7 Oct 2026

FOCUS: First Order Concentrated Updating Scheme

arXiv 2501.12243 ↗First posted 21 Jan 2025cs.LG cs.CL math.OCcited by 7

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) demonstrate remarkable performance, and improving their pre-training process appears to be key to enhancing their capabilities further. Based on the documented success of Adam, learning rate decay, and weight decay, we hypothesize that the pre-training loss landscape features a narrowing valley structure. Through experiments with synthetic loss functions, we discover that when gradient query noise is high relative to the valley's sharpness, Adam's performance falls behind that of Signum because Adam reduces the effective step size too drastically. This observation led us to develop FOCUS, an optimizer that enhances Signum by incorporating attraction toward moving averaged parameters, allowing it to handle noise better while maintaining larger step sizes. In training GPT-2, FOCUS proves to be more stable than Signum and faster than Adam. These results suggest that gradient noise may be an underappreciated limiting factor in LLM training, and FOCUS offers promising solutions.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 34 of its 45 references that are in the map. First posted on arXiv 21 Jan 2025.

Builds on

34 of 45 references.

References · 34

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  4. 2020Scaling Laws for Neural Language Modelscited by 6,411
  5. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  6. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  7. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  8. 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
  9. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,199
  10. 2022Galactica: A Large Language Model for Sciencecited by 736
  11. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  12. 2023Symbolic Discovery of Optimization Algorithmscited by 423
22 more
  1. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  2. 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
  3. 2018Gradient Descent Happens in a Tiny Subspacecited by 208
  4. 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 179
  5. 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 156
  6. 2024Adam-mini: Use Fewer Learning Rates To Gain Morecited by 134
  7. 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
  8. 2024Understanding Warmup-Stable-Decay Learning Rates: A River Valley Loss Landscape Perspectivecited by 75
  9. 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 70
  10. 2024Exponential Moving Average of Weights in Deep Learning: Dynamics and Benefitscited by 65
  11. 2024Scalable Optimization in the Modular Normcited by 64
  12. 2024MARS: Unleashing the Power of Variance Reduction for Training Large Modelscited by 59
  13. 2024The AdEMAMix Optimizer: Better, Faster, Oldercited by 47
  14. 2024How to set AdamW's weight decay as you scale model and dataset sizecited by 42
  15. 2024Cautious Optimizers: Improving Training with One Line of Codecited by 42
  16. 2024Deconstructing What Makes a Good Optimizer for Language Modelscited by 40
  17. 2020On Learning Rates and Schr"odinger Operatorscited by 33
  18. 2019How noise affects the Hessian spectrum in overparameterized neural networkscited by 17
  19. 2024The boundary of neural network trainability is fractalcited by 12
  20. 2022On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walkscited by 9
  21. 2023How Good is Google Bard's Visual Understanding? An Empirical Study on Open Challengescited by 9
  22. 2024Complex fractal trainability boundary can arise from trivial non-convexitycited by 1

Built on by

Cited by year (2026 to 7 Oct)

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

7 papers.