mlsanityData to 7 Oct 2026

Flowing Through Layers: A Continuous Dynamical Systems Perspective on Transformers

arXiv 2502.05656 ↗First posted 8 Feb 2025cs.LG math.DScited by 2

Not on the map. Why?

Abstract (arXiv)

We show that the standard discrete update rule of transformer layers can be naturally interpreted as a forward Euler discretization of a continuous dynamical system. Our Transformer Flow Approximation Theorem demonstrates that, under standard Lipschitz continuity assumptions, token representations converge uniformly to the unique solution of an ODE as the number of layers grows. Moreover, if the underlying mapping satisfies a one-sided Lipschitz condition with a negative constant, the resulting dynamics are contractive, causing perturbations to decay exponentially across layers. Beyond clarifying the empirical stability and expressivity of transformer models, these insights link transformer updates to a broader iterative reasoning framework, suggesting new avenues for accelerated convergence and architectural innovations inspired by dynamical systems theory.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 11 references that are in the map. First posted on arXiv 8 Feb 2025.

Builds on

8 of 11 references.

References · 8

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2018Neural Ordinary Differential Equationscited by 3,733
  4. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  5. 2017Stable Architectures for Deep Neural Networkscited by 340
  6. 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
  7. 2018Deep Neural Networks Motivated by Partial Differential Equationscited by 187
  8. 2025Iterate to Accelerate: A Unified Framework for Iterative Reasoning and Feedback Convergencecited by 1

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.