We present the first systematic study of weight matrix singular value spectra \emph{during} transformer pretraining, tracking full SVD decompositions of every weight matrix at 25-step intervals across three model scales (30M–285M parameters). We discover three phenomena: stable rank compression propagates as a traveling wave from early to late layers, creating a dramatic gradient that peaks early then \emph{reverses} – late layers eventually over-compress past early layers. the power-law exponent~ develops a permanent depth gradient forming a non-monotonic inverted-U in deeper models, with peaks shifting toward earlier layers as depth increases. value/output projections compress uniformly while query/key projections carry the full depth-dependent dynamics. The dissociation between transient compression and persistent spectral shape reveals that \emph{rank and spectral shape encode fundamentally different information about training}. We formalize this as a two-timescale dynamical model and derive scaling laws (, ). We validate on nine models across three families (custom, GPT-2, Pythia; 30M–1B parameters; 8–36 layers), demonstrate that predicts layer importance (–, ), and show that spectral-guided pruning outperforms Last-N heuristics by – across seven models in two families (GPT-2 124M–774M, Pythia 160M–1B), with worst-vs-best gaps up to confirming the causal role of spectral structure.

生成讲解博客的中文版本

生成AI智能校验的中文版本