Sign inGet started
Paper · arXiv

Asymptotic Behavior of Transformers

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...

AuthorsKaty Blumer, Da-Cheng Juan, Jon Kleinberg et al.
Primary categorycs.LG
Published14 October 2026
Last updated at source14 October 2026
cs.LGcs.AImath.ST
Embed this entry
<iframe src="https://silytics.si/embed/item/7e70ad03-5e77-4e04-aa11-8002b7608c0a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 15 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.