aiqbench analysis
CAST introduces a history-adaptive method for spectral clipping during LLM pretraining, dynamically adjusting gradient scales and thresholds to stabilize optimization in large-scale mixture-of-experts models. By leveraging AdamW's second moment estimates and exponential moving averages of spectral norms, the technique reduces gradient spikes and accelerates convergence compared to nine competing baselines. This research offers a practical advancement for training efficiency and loss reduction in next-generation foundation model development.
CAST: History-Adaptive Spectral Clipping for LLM Pretraining
arXiv:2610.19761v1 Announce Type: new Abstract: Soft spectral clipping (SSC) reduces gradient singular values, but its effect depends on the gradient scale and clipping threshold. We introduce CAST (Clipping with Adaptive Scales and Thresholds), a history-adaptive extension of SSC. AdamW's previous second moment sets row and column scales. An exponential moving average of the clipped output's estimated spectral norm sets each matrix's threshold. CAST restores the original coordinates before the AdamW update. We train a mixture-of-experts (MoE) model with 19.08B total parameters for 83.89B tokens. CAST achieves lower training and mean validation losses than nine gradient-processing baselines, with the fewest relative gradient spikes. It reaches the best baseline's final smoothed training loss in 7.2\% fewer steps.
Abstract:Soft spectral clipping (SSC) reduces gradient singular values, but its effect depends on the gradient scale and clipping threshold. We introduce CAST (Clipping with Adaptive Scales and Thresholds), a history-adaptive extension of SSC. AdamW's previous second moment sets row and column scales. An exponential moving average of the clipped output's estimated spectral norm sets each matrix's threshold. CAST restores the original coordinates before the AdamW update. We train a mixture-of-experts (MoE) model with 19.08B total parameters for 83.89B tokens. CAST achieves lower training and mean validation losses than nine gradient-processing baselines, with the fewest relative gradient spikes. It reaches the best baseline's final smoothed training loss in 7.2\% fewer steps.
Machine Learning (cs.LG)
arXiv:2610.19761 [cs.LG]
(or arXiv:2610.19761v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.19761 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 204 words
Related coverage
Reuse or Relearn? A Spectral View of Earth Observation Foundation Models
arXiv · Sep 30, 2026
Exploring the Potential of Contrastive Language-Image Pre-training for Multi-Source Remote Sensing Data
arXiv · Sep 5, 2026
Learned Compression of SAR Phase-History Data: A Rate-Honest Feasibility Study on GOTCHA
arXiv · Sep 30, 2026
Compute-Optimal Pretrain--Fine-tune in Ridge Gradient Descent
arXiv · Sep 16, 2026