Learning to Read Out: Unembedding Dynamics in Language Model Pretraining

Matteo He, William F. Shen, Alex Iacob, Andrej Jovanovic, Xinchi Qiu, Nicholas D. Lane

University of Cambridge · Flower Labs · Isomorphic Labs

Published October 14, 2026 · on the feed October 16, 2026 · ▲ 3 · arXiv 2610.21025

LLM training & RLInterpretability & analysis Full code arXiv ↗Hugging Face ↗Weights ↗Dataset ↗

The abstract

When does a language model acquire a capability? Developmental studies usually answer this by tracking when models start producing the correct token. But that prediction passes through the unembedding matrix, or readout, which is itself still being learned during pretraining. We show that a model's hidden states can encode task information before its own readout expresses it, so timelines read from outputs conflate what the model encodes with what its readout expresses. To track the readout directly, we introduce parameter-trajectory crosscoding, which fits one sparse dictionary to every token's readout row at every checkpoint. Unlike crosscoders on activations, it needs only checkpoint weights. We use it to locate a narrow early window, 0.4-1.1% of the way through Pythia's pretraining, in which the readout reorganizes and WordNet word categories become decodable from its rows. By then, linear probes on the hidden states already decode task information that the model's own outputs do not yet show. To test whether such gaps depend on how fast the readout learns, we pretrain small models from scratch that differ only in the readout's learning rate. We find that raising it makes the readout develop earlier and the gap close sooner, with little effect on final loss. Together, these results imply that early in training, where many developmental transitions are dated, a behavioral date can reflect when the readout learns to express task information and not when the model learns it.

The Brief

2:49

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Learning to Read Out. Unembedding Dynamics in Language Model Pretraining. By Matteo He and five others, from the University of Cambridge, Flower Labs, and one other institution. Published on the fourteenth of October. Its code repository is worked out: about one hundred and forty source files, with a readme and a licence.

When does a language model acquire a capability? Developmental studies usually answer by tracking when the model starts producing the correct token. But that prediction passes through the unembedding matrix, the readout, and the readout is itself still being learned during pretraining. The claim is that a model's hidden states can encode task information before its own readout expresses it. Timelines read from outputs therefore mix together two things: what the model encodes, and what its readout is able to express. A model might know the answer internally and still fail to say it, simply because the last layer that turns hidden states into tokens has not caught up. Dating the capability by the output would then date the readout, not the knowledge.

To watch the readout directly, the authors introduce parameter-trajectory crosscoding. It fits one sparse dictionary to every token's readout row, at every checkpoint. Unlike crosscoders applied to activations, it needs nothing but the checkpoint weights. Each token has a row in the readout, and the method follows all of those rows across training with one shared dictionary, so changes in the readout can be compared from checkpoint to checkpoint.

Applied to Pythia, it locates a narrow early window, between zero point four and one point one percent of the way through pretraining. In that window the readout reorganises, and WordNet word categories become decodable from its rows. By that point, linear probes on the hidden states already decode task information that the model's own outputs do not yet show. The inside is ahead of the outside: the information is there to be decoded before the model puts it into its predictions.

The second line of evidence is an intervention. To test whether such gaps depend on how fast the readout learns, the authors pretrain small models from scratch that differ only in the readout's learning rate. Raising that rate makes the readout develop earlier and the gap close sooner, with little effect on the final loss. Speed up the readout, and the behaviour shows up earlier, even though what the model ends up with barely changes.

The claim concerns early training, which is also where many developmental transitions are dated. The readout window sits in Pythia's pretraining, and the learning-rate test uses small models trained from scratch. And the conclusion is that a behavioral date can reflect when the readout learns to express task information: a possibility for any given milestone, not a rule for every one.

The implication the authors draw is a correction to how milestones are read. When a capability first appears in a model's outputs early in training, that date may mark when the readout learned to express the information, not when the model learned it. Watching outputs alone, the two are indistinguishable.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.