mlsanityData to 14 Oct 2026

Algebraic Dead Directions in LayerNorm Transformers: A Forward-Pass-Only Diagnostic at LLM Scale

arXiv 2606.19491 ↗First posted 17 Jun 2026cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Pretrained transformers sit near singular minima of the loss, where the Fisher information metric degenerates along dead directions: directions in parameter space along which the directional Fisher vanishes. Locating such a direction normally needs a forward pass and an eigendecomposition of activations, or a sampling-based complexity estimate; none returns a direction computable from the network's parameters alone. We give one, for LayerNorm transformers. The inverse-scale direction γ-1/|γ-1| of the LayerNorm affine is an exact algebraic kernel of the post-final-norm centred activation covariance, for any input distribution, and induces a corresponding dead direction in parameter space. It is read from the LN scale parameter alone, with no forward or backward pass and no eigensolve: the cheapest dead-direction read, specific to LayerNorm. We test it on 14 pretrained transformers (9 LayerNorm, 5 RMSNorm; 160M-35B; language and vision objectives). At random initialisation the predicted direction matches the measured bottom singular direction (one forward pass, direct SVD) to four decimal places on 9/9 LayerNorm models, and is correctly absent on 5/5 RMSNorm models, which lack the mean-subtraction projector that creates it. On the trained checkpoint the covariance eigenvalue along this direction deepens by ~103× and further dead directions open; the random-init-to-trained gap is a one-forward-pass, per-checkpoint readout of singular structure along the predicted coordinate. Two consequences follow in closed form: the residual stream's smallest singular value is preserved block-to-block on 13/14 transformers measured on their own input distribution, the one exception (Gemma4-31B) a genuine dead direction the same read pinpoints; and the kernel direction's presence classifies a transformer's normalisation from the parameters alone.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 40 of its 51 references that are in the map. First posted on arXiv 17 Jun 2026.

Builds on

40 of 51 references.

References · 40

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  2. 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
  3. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  4. 2025Gemma 3 Technical Reportcited by 1,824
  5. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  6. 2025DINOv3cited by 1,414
  7. 2025SigLIP 2: Multilingual Vision-Language Encoders with Improved Semantic Understanding, Localization, and Dense Featurescited by 1,188
  8. 2024Gemma: Open Models Based on Gemini Research and Technologycited by 916
  9. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  10. 2025V-JEPA 2: Self-Supervised Video Models Enable Understanding, Prediction and Planningcited by 809
  11. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  12. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
28 more
  1. 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
  2. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
  3. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  4. 2024Massive Activations in Large Language Modelscited by 294
  5. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  6. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
  7. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
  8. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
  9. 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 146
  10. 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 141
  11. 2022Signal Propagation in Transformers: Theoretical Perspectives and the Role of Rank Collapsecited by 141
  12. 2020Traces of Class/Cross-Class Structure Pervade Deep Learning Spectracited by 94
  13. 2018Universal Statistics of Fisher Information in Deep Neural Networks: Mean Field Approachcited by 91
  14. 2023Transformers learn through gradual rank increasecited by 52
  15. 2023The Local Learning Coefficient: A Singularity-Aware Complexity Measurecited by 51
  16. 2023Kronecker-Factored Approximate Curvature for Modern Neural Network Architecturescited by 49
  17. 2019Stable Rank Normalization for Improved Generalization in Neural Networks and GANscited by 41
  18. 2024Loss Landscape Degeneracy and Stagewise Development in Transformerscited by 40
  19. 2024Differentiation and Specialization of Attention Heads via the Refined Local Learning Coefficientcited by 40
  20. 2025Peri-LN: Revisiting Normalization Layer in the Transformer Architecturecited by 34
  21. 2019Pathological spectra of the Fisher information metric and its variants in deep neural networkscited by 32
  22. 2024Small Singular Values Matter: A Random Matrix Analysis of Transformer Modelscited by 21
  23. 2025EigenTrack: Spectral Activation Feature Tracking for Hallucination and Out-of-Distribution Detection in LLMs and VLMscited by 10
  24. 2025Dimensional Collapse in Transformer Attention Outputs: A Challenge for Sparse Dictionary Learningcited by 6
  25. 2026Spectral Edge Dynamics of Training Trajectories: Signal--Noise Geometry Across Scalescited by 6
  26. 2026NerVE: Nonlinear Eigenspectrum Dynamics in LLM Feed-Forward Networkscited by 3
  27. 2024Geometry and Dynamics of LayerNormcited by 2
  28. 2025Singular Fluctuation as Specific Heat in Bayesian Learningcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.