Dynamics of the Transformer Residual Stream: Coupling Spectral Geometry to Network Topology
Not on the map. Why?
Abstract (arXiv)
Large language models are remarkably capable, yet how computation propagates through their layers remains poorly understood. A growing line of work treats depth as discrete time and the residual stream as a dynamical system, where each layer's nonlinear update has a local linear description. However, previous analyses have relied on scalar summaries or approximate linearizations, leaving the full spectral geometry of trained LLMs unknown. We perform full Jacobian eigendecomposition across three production--scale LLMs and show that training installs a monotonic spectral gradient through depth -- from non-normal, rotation-dominated early layers to near--symmetric late layers -- together with a cumulative low-rank bottleneck that funnels perturbations into a small fraction of the residual stream's effective dimensions. Our experiments reveal that this gradient and the dimensional collapse are learned rather than architectural, and is largely dissolved when structured non-normality is removed. We further show that the topological positioning of graph communities predicts whether the Jacobian amplifies or suppresses them, with the sign of the coupling determined by the local operator type, a relationship absent at initialization. These results map a learned spectral geometry in LLMs that links perturbation propagation and compression to the network's functional topology.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 26 of its 32 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
26 of 32 references.
References · 26
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2016Understanding intermediate layers using linear classifier probescited by 1,353
- 2022In-context Learning and Induction Headscited by 964
- 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 261
- 2016Deep Information Propagationcited by 195
- 2018Deep Neural Networks Motivated by Partial Differential Equationscited by 187
- 2023A mathematical perspective on Transformerscited by 164
- 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
14 more
- 2019Understanding and Improving Transformer From a Multi-Particle Dynamic System Point of Viewcited by 113
- 2026Parcae: Scaling Laws For Stable Looped Language Modelscited by 55
- 2023Large language models implicitly learn to straighten neural sentence trajectories to construct a predictive representation of natural languagecited by 32
- 2025Block-Recurrent Dynamics in Vision Transformerscited by 20
- 2024Residual Stream Analysis with Multi-Layer SAEscited by 19
- 2023Finite-time Lyapunov exponents of deep neural networkscited by 12
- 2025Transformer Dynamics: A neuroscientific approach to interpretability of large language modelscited by 11
- 2024Transformer Block Coupling and its Correlation with Generalization in LLMscited by 10
- 2018Understanding Community Structure in Layered Neural Networkscited by 7
- 2023Gradient Flossing: Improving Gradient Descent through Dynamic Control of Jacobianscited by 5
- 2026Homogenized Transformerscited by 5
- 2026Spectral Conditioning of Attention Improves Transformer Performancecited by 3
- 2025CAST: Compositional Analysis via Spectral Tracking for Understanding Transformer Layer Functionscited by 2
- 2026SCORE: Replacing Layer Stacking with Contractive Recurrent Depthcited by 2
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Off-Axis, On Purpose: Where a Transformer Computes Concepts and Why it Does Socited by 1
- 2026Fingerprint, Not Blueprint: How Positional Schemes Set the Default Spectral Algebra of Attentioncited by 0
- 2026Relevant and Irrelevant: A Renormalization Group Analysis of Transformer Attentioncited by 0
- 2026The Depth Flow of Token Representations Is Nonlinear and Does Not Descend Its Own Densitycited by 0
- 2026Pretraining Shapes Spectral Structure: Architecture- and Strategy-Conditional Prediction of OOD Robustness in Foundation Modelscited by 0
- 2026Pretraining Shapes Spectral Structure: Architecture- and Strategy-Conditional Prediction of OOD Robustness in Foundation Models7 Oct 2026
- 2026The Depth Flow of Token Representations Is Nonlinear and Does Not Descend Its Own Density30 Aug 2026
- 2026Off-Axis, On Purpose: Where a Transformer Computes Concepts and Why it Does So10 Aug 2026
- 2026Relevant and Irrelevant: A Renormalization Group Analysis of Transformer Attention16 Jul 2026
- 2026Fingerprint, Not Blueprint: How Positional Schemes Set the Default Spectral Algebra of Attention7 Jul 2026