mlsanityData to 7 Oct 2026

Enhancing LLM Training via Spectral Clipping

arXiv 2603.14315 ↗First posted 15 Mar 2026cs.LG math.OCcited by 5

Not on the map. Why?

Abstract (arXiv)

While spectral-based optimizers like Muon operate directly on the spectrum of updates, standard adaptive methods such as AdamW do not account for the spectral structure of weights and gradients, leaving them vulnerable to two empirical issues in large language model (LLM) training: (i) the optimizer updates can have large spectral norms, potentially destabilizing training and degrading generalization; (ii) stochastic gradient noise can exhibit sparse spectral spikes, with a few dominant singular values much larger than the rest. We propose SPECTRA, a general framework addressing these by (i) post-spectral clipping of updates to enforce spectral-norm constraints (ii) optional pre-spectral clipping of gradients to suppress spectral noise spikes. We prove that post-clipping constitutes a Composite Frank-Wolfe method with spectral-norm constraints and weight regularization. We further analyze how pre-clipping mitigates sparse spectral spikes. We propose efficient soft spectral clipping via Newton-Schulz iterations, avoiding expensive SVD. Experiments on LLM pretraining show SPECTRA uniformly improves validation loss for various optimizers, including AdamW, Signum, Mars, and AdEMAMix, with the best-performing variants achieving state-of-the-art results. Models trained with SPECTRA exhibit smaller weight norms, confirming the link between spectral clipping and regularization.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 59 of its 96 references that are in the map. First posted on arXiv 15 Mar 2026.

Builds on

59 of 96 references.

References · 59

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  5. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  6. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  7. 2020GLU Variants Improve Transformercited by 1,724
  8. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  9. 2019Root Mean Square Layer Normalizationcited by 1,425
  10. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
  11. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  12. 2020Aligning AI With Shared Human Valuescited by 706
38 more
  1. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  2. 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
  3. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  4. 2025Muon is Scalable for LLM Trainingcited by 381
  5. 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 335
  6. 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 302
  7. 2016Using the Output Embedding to Improve Language Modelscited by 266
  8. 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
  9. 2023Small-scale proxies for large-scale Transformer training instabilitiescited by 182
  10. 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 179
  11. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
  12. 2024Old Optimizer, New Norm: An Anthologycited by 173
  13. 2024Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durationscited by 160
  14. 2020Learning from History for Byzantine Robust Optimizationcited by 137
  15. 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
  16. 2025The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithmcited by 104
  17. 2023Revisiting Gradient Clipping: Stochastic bias and tight convergence guaranteescited by 83
  18. 2018Byzantine Stochastic Gradient Descentcited by 81
  19. 2025Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)cited by 66
  20. 2024MARS: Unleashing the Power of Variance Reduction for Training Large Modelscited by 59
  21. 2025AdaMuon: Adaptive Muon Optimizercited by 59
  22. 2025ASGO: Adaptive Structured Gradient Optimizationcited by 55
  23. 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 53
  24. 2023Toward Understanding Why Adam Converges Faster Than SGD for Transformerscited by 50
  25. 2018Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximizationcited by 47
  26. 2024The AdEMAMix Optimizer: Better, Faster, Oldercited by 47
  27. 2025Structured Preconditioners in Adaptive Optimization: A Unified Analysiscited by 30
  28. 2025SPAM: Spike-Aware Adam with Momentum Reset for Stable LLM Trainingcited by 27
  29. 2024Methods for Convex (L0,L1)-Smooth Optimization: Clipping, Acceleration, and Adaptivitycited by 25
  30. 2025An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variantscited by 25
  31. 2025When do spectral gradient updates help in deep learning?cited by 25
  32. 2025AdaGrad Meets Muon: Adaptive Stepsizes for Orthogonal Updatescited by 22
  33. 2024Adam Exploits ℓ_∞-geometry of Loss Landscape via Coordinate-wise Adaptivitycited by 20
  34. 2024Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailedcited by 18
  35. 2018A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programmingcited by 14
  36. 2022Fast Differentiable Matrix Square Rootcited by 14
  37. 2013Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimizationcited by 13
  38. 2025Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under (L0, L1)-Smoothnesscited by 12

50 most cited of 59 All 59 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 5.

5 papers.