AI & ML
Asymptotic Behavior of Transformers
arXiv stat.TH0 views
arXiv:2610.19358v1 Announce Type: cross Abstract: In this paper we study the behavior of transformer networks generating text over long periods of time. We show that even a three-token, single-layer attention-only transformer can fail to converge. We then study a rich class of transformers with arbitrary finite depth, layer normalization, MLPs, RoPE encodings, and an arbitrary mix of local and global layers. Every transformer in this class has a softmax temperature threshold above which its empirical cache distribution converges to a unique limit, independent of initial conditions. We show further that, while each transformer has a temperature threshold, the supremum of this set is infinite, so there is no global minimal temperature that forces all transformers to converge.
Source:https://arxiv.org/abs/2610.19358PreviousOn rigidity of infinite exchangeable sequencesNextOn Inherent Privacy of Posterior Sampling: A Unified R\'enyi-Divergence Framework
Related posts
Heated mirror reveals hidden 3D patterns in rising air near a wall
0Phys.org Tech
Infrared-transparent aerogel boosts performance of subambient daytime radiative cooling materials by up to 5.2°C
0Phys.org Tech
Tracing the online networks behind AI-generated nude images
0Phys.org Tech
Microsoft's AI Risk Report Misses This Key Detail
0Dark Reading
Introducing the Grid Protectors Program
0OpenAI Blog
The world has a new plan to save nature, but it still needs the money
0Ars Technica