arXiv AI

Reachability and asymptotics of Gaussian Transformer dynamics

arXiv:2606. 07600v1 Announce Type: cross Abstract: We formulate data propagation through the Transformer, the machine learning architecture powering large language models, as a nonlinear control system on the space of probability measures.

Hugging Face Trending Papers
Jul 30

Generalization Bounds on Optimal Control for Transformer Training and Wasserstein Distributional Robustness

We derive finite-sample generalization bounds for Transformers trained with dynamic programming recursions. Building on the doubly lifted, measure-valued formulation of Transformer dynamics, we view data sets as probability laws on pairs of empirical input-output measures, allowing us to interpret the training problem as a finite-horizon Markovian control problem.

arXiv Machine Learning
Aug 6

A Mechanistic Analysis of Transformers for Dynamical Systems

arXiv:2512. 21113v2 Announce Type: replace Abstract: Transformers are increasingly adopted for modeling and forecasting time-series, yet their internal mechanisms remain poorly understood from a dynamical systems perspective.

By Gregory Duth\'e, Nikolaos Evangelou, Wei Liu, Ioannis G. Kevrekidis, Eleni Chatzi
arXiv Machine Learning
Sep 14

On Universality of Non-Separable Approximate Message Passing Algorithms

The paper studies universality in non‑separable Approximate Message Passing (AMP) algorithms. It introduces a Bounded Composition Property (BCP) for polynomial non‑linearities and a BCP‑approximability condition for Lipschitz AMP, showing that these conditions guarantee state‑evolution universality for matrices with non‑Gaussian entries. The authors demonstrate that many common non‑separable non‑linearities—such as local denoisers, spectral denoisers, and compositions of separable functions with generic linear maps—satisfy these conditions, thereby extending universality results beyond Gaussian or rotationally‑invariant data.

By Max Lovig, Tianhao Wang, Zhou Fan