The information geometry of large language models is shared, learned, and controllable

Dario Picozzi

University College London · London Centre for Nanotechnology

Published September 10, 2026 · on the feed September 22, 2026 · ▲ 5 · arXiv 2609.11063

LLM training & RLModel architecture Full code arXiv ↗Hugging Face ↗

The abstract

Large language models learn similar behaviours, yet it remains unclear what structure they share or how to change one behaviour without disturbing others. The Fisher-Rao geometry of next-token probabilities connects these questions: behaviour determines this geometry up to output-preserving symmetries, whereas activation geometry depends on coordinates. Across transformer, state-space and recurrent models, output geometries agree more strongly than activation geometries, and shared geometry supports semantic-category transfer. Agreement with human word choices increases with predictive accuracy, scale and training, and improves further after model-only calibration. Token probabilities and read-out geometry jointly predict the spectrum and its effective dimension. Controlled language assignments show that geometry follows the language law across architectures. Pretraining corpus statistics predict held-out fact acquisition without recalibration, while randomised experiments show that deeper evidence substantially delays acquisition across every tested architecture and evidence construction. Finally, the geometry prescribes minimum-disturbance local interventions, predicts their relative cost, and supports reusable control: updates learned on donor prompts transfer to unseen prompts while better preserving behaviour on reference prompts than Euclidean control. The same geometric correction improves steering, editing, attribution, dictionary learning and fine-tuning.

The Brief

2:44

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

Transcript

The information geometry of large language models is shared, learned, and controllable. By Dario Picozzi, from University College London and the London Centre for Nanotechnology. Published on the tenth of September. Its code repository is worked out: about one hundred source files, with a readme and a licence.

Large language models learn similar behaviours, but two things have stayed unclear: what structure they actually share, and how to change one behaviour without disturbing the others. The claim here is that a single object answers both. That object is the Fisher-Rao geometry of next-token probabilities. The argument for choosing it is a contrast. Behaviour determines this output geometry, up to symmetries that preserve the outputs. Activation geometry, by comparison, depends on the coordinates a particular model happens to use. So if models share something real, the output geometry is where it should show.

Across transformer, state-space and recurrent models, output geometries agree more strongly than activation geometries do, and that shared geometry supports transfer of semantic categories. Agreement with human word choices increases with predictive accuracy, with scale and with training, and improves again after calibration that uses the model alone. Token probabilities and read-out geometry together predict the spectrum and its effective dimension.

The geometry is also shown to be learned in a lawful way. Under controlled language assignments, it follows the language law across architectures. Statistics of the pretraining corpus predict which held-out facts are acquired, without recalibration, while randomised experiments show that deeper evidence substantially delays acquisition, in every architecture and every evidence construction tested.

Then the controllable part. The geometry prescribes local interventions that cause minimum disturbance, and predicts their relative cost. It supports reusable control: updates learned on donor prompts transfer to unseen prompts, while preserving behaviour on reference prompts better than Euclidean control does. The same geometric correction improves steering, editing, attribution, dictionary learning and fine-tuning.

The breadth claimed is across architecture families: transformer, state-space and recurrent. The fact-acquisition result is stated for every architecture and evidence construction that was tested, which is the boundary of that claim. The control results are comparisons against Euclidean control, on behaviour measured at reference prompts. And the agreement with human word choices is conditional: it grows with accuracy, scale and training rather than holding for every model.

The three words in the title map onto the three parts of the evidence. Shared, because output geometry agrees across very different model families. Learned, because it tracks training, scale and corpus statistics in predictable ways. Controllable, because respecting that geometry makes interventions travel further while breaking less.

Paper Quest · 7 chapters · about 39 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Models seem to learn alike, yet we measure them in coordinates they never chose. Start there.

You want to know what different language models share, and how to change one behaviour without disturbing the others. Distances between internal activations look like the natural tool.

The road ahead

  1. 1 · The problem ~6 min Distances between a model's internal activations seem the natural way to compare models, but they shift whenever the same model is rewritten in new coordinates.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min Measure models by their next-token probabilities, whose Fisher-Rao geometry is fixed by behaviour, then compare and steer them with that geometry.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Measure the output geometry, derive from it the least-disturbing local change, learn that change on donor prompts, then reuse it on unseen prompts.
  6. 6 · The experiment ~6 min You’ll guess: Across transformer, state-space and recurrent models, which agreed more strongly between models: output geometries or activation geometries?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

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.