
DA
Dmitrii Andriianov, Andrey Veprikov, Aleksandr Beznosikov
· 1 min read
ResearcharXiv cs.LG
Spectral Weight Decay: Inducing Low-Rank Structure in Neural Network Weights
arXiv:2610.11730v1 Announce Type: new
Abstract: Standard weight decay treats each weight matrix as a vector and ignores its spectral structure. We introduce spectral weight decay, a post-step decoupled nuclear-norm update that applies additive rather than multiplicative spectral shrinkage. We connect the update to approximate proximal descent and show that its sensitivity to update order can exceed that of conventional $\ell_2$ weight decay near rank deficiency. Across LLaMA models with $124$M to $500$M parameters, spectral weight decay lowers effective rank and improves SVD-LLM compression at matched validation loss. At $500$M and a $4\%$ distortion budget, it reaches $1.89\times$ compression and $1.18\times$ GPU inference speedup, compared with $1.14\times$ and $1.01\times$ after standard weight decay. Under fixed-horizon training with $60\%$ label noise, it also improves final mean clean-test accuracy over matched $\ell_2$ regularization by up to $17.8$ points on MNIST and $4.6$ points across four BERT-base tasks. Code is available at https://github.com/brain-lab-research/SpectralWD.
Original source
This story was published by arXiv cs.LG and written by Dmitrii Andriianov, Andrey Veprikov, Aleksandr Beznosikov. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


