paper-with-me

Papers

Spectra: Rethinking Optimizers for LLMs Under Spectral Anisotropy

2026-01-30 · Zhendong Huang, Hengjie Cao, Fang Dong, Ruijun Huang, Mengyi Chen, Yifeng Yang, Xin Zhang, Anrui Chen, Mingzhi Dong, Yujiang Wang, Jinlong Hou, Qin Lv, Robert P. Dick, Yuan Cheng, Fan Yang, Tun Lu, Li Shang arxiv

Gradient signals in LLM training are highly anisotropic: recurrent linguistic structure concentrates energy into a small set of dominant spectral directions, while context specific information resides in a long tail. We show that this spike tail separation persists throughout training, with the spike occupying only about 1.5% of directions yet dominating optimizer statistics. This dominance suppresses tail learning by contracting tail updates through second moment normalization and tightening the globally stable learning rate bound. Motivated by this analysis, we propose Spectra, a spike aware optimizer that suppresses the dominant low rank spike subspace without amplifying the noise sensitive spectral tail. Spectra tracks the spike subspace via cached, warm started power iteration and applies low rank spectral shaping with negligible overhead and substantially reduced optimizer state memory. On LLaMA3 8B trained on 50B tokens, Spectra reaches the same target loss 30% faster than AdamW, reduces per step end to end overhead by 0.7%, cuts optimizer state memory by 49.25%, and improves average downstream accuracy by 1.62%. Compared to Muon, Spectra is 5.1x faster in optimizer processing time, achieves a lower final loss, and improves average accuracy by 0.66%.

📄 PDF Abstract BibTeX arXiv:2602.11185

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Enhancing LLM Training via Spectral Clipping

2026-03-15 · Xiaowen Jiang, Andrei Semenov, Sebastian U. Stich 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 t…

Towards a Principled Muon under $μ\mathsf{P}$: Ensuring Spectral Conditions throughout Training

2026-01-04 · John Zhao arxiv

The $μ$-parameterization ($μ$P) provides a principled foundation for large language model (LLM) training by prescribing width-independent learning dynamics, which in turn enables predictable scaling behavior and robust h…

Rethinking Bregman Divergences in Kronecker-Factored Optimizers

2026-05-30 · Bing Liu, Wenjie Zhou, Chengcheng Zhao arxiv

Shampoo-style optimizers approximate gradient covariance matrices using Kronecker-factored structures. Recent work~\cite{lin2026understanding} showed that such approximations can be viewed as projections under Bregman ma…

Uniform Spectral Growth and Convergence of Muon in LoRA-Style Matrix Factorization

2026-02-06 · Changmin Kang, Jihun Yun, Baekrok Shin, Yeseul Cho 외 arxiv

Spectral gradient descent (SpecGD) orthogonalizes the matrix parameter updates and has inspired practical optimizers such as Muon. They often perform well in large language model (LLM) training, but their dynamics remain…

What Really Matters in Matrix-Whitening Optimizers?

2025-10-28 · Kevin Frans, Pieter Abbeel, Sergey Levine arxiv

A range of recent optimizers have emerged that approximate the same "matrix-whitening" transformation in various ways. In this work, we systematically deconstruct such optimizers, aiming to disentangle the key components…