Sign inGet started
Paper · arXiv

Predictive Geometry of Hidden Trajectories in Transformers

Decoder-only transformers are trained only through a terminal next-token prediction loss, yet this loss constrains every intermediate hidden state through the fixed downstream computation. We formalize this constraint by studying layerwise loss-to-go functions: the terminal loss obtained by continuing a candidate hidden state through the remaining transformer blocks. Around successful validation trajectories, we show that the local second-order geometry of these functions is governed, up to low-loss residual terms, by a pullback Fisher operator on hidden-state space. Its spectrum identifies output-sensitive directions and approximately prediction-null directions, yielding a local observab...

AuthorsTimur Mudarisov, Mikhail Burtsev, Tatiana Petrova et al.
Primary categorycs.LG
Published29 September 2026
Last updated at source29 September 2026
cs.LGcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/b18f1fcf-5e38-465e-a5e7-b8b07ee4fea3" 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 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.