Transformers learn factored representations
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910008992595968 |
|---|---|
| author | Shai, Adam Amdahl-Culleton, Loren Christensen, Casper L. Bigelow, Henry R. Rosas, Fernando E. Boyd, Alexander B. Alt, Eric A. Ray, Kyle J. Riechers, Paul M. |
| author_facet | Shai, Adam Amdahl-Culleton, Loren Christensen, Casper L. Bigelow, Henry R. Rosas, Fernando E. Boyd, Alexander B. Alt, Eric A. Ray, Kyle J. Riechers, Paul M. |
| contents | Transformers pretrained via next token prediction learn to factor their world into parts, representing these factors in orthogonal subspaces of the residual stream. We formalize two representational hypotheses: (1) a representation in the product space of all factors, whose dimension grows exponentially with the number of parts, or (2) a factored representation in orthogonal subspaces, whose dimension grows linearly. The factored representation is lossless when factors are conditionally independent, but sacrifices predictive fidelity otherwise, creating a tradeoff between dimensional efficiency and accuracy. We derive precise predictions about the geometric structure of activations for each, including the number of subspaces, their dimensionality, and the arrangement of context embeddings within them. We test between these hypotheses on transformers trained on synthetic processes with known latent structure. Models learn factored representations when factors are conditionally independent, and continue to favor them early in training even when noise or hidden dependencies undermine conditional independence, reflecting an inductive bias toward factoring at the cost of fidelity. This provides a principled explanation for why transformers decompose the world into parts, and suggests that interpretable low dimensional structure may persist even in models trained on complex data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_02385 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Transformers learn factored representations Shai, Adam Amdahl-Culleton, Loren Christensen, Casper L. Bigelow, Henry R. Rosas, Fernando E. Boyd, Alexander B. Alt, Eric A. Ray, Kyle J. Riechers, Paul M. Machine Learning Transformers pretrained via next token prediction learn to factor their world into parts, representing these factors in orthogonal subspaces of the residual stream. We formalize two representational hypotheses: (1) a representation in the product space of all factors, whose dimension grows exponentially with the number of parts, or (2) a factored representation in orthogonal subspaces, whose dimension grows linearly. The factored representation is lossless when factors are conditionally independent, but sacrifices predictive fidelity otherwise, creating a tradeoff between dimensional efficiency and accuracy. We derive precise predictions about the geometric structure of activations for each, including the number of subspaces, their dimensionality, and the arrangement of context embeddings within them. We test between these hypotheses on transformers trained on synthetic processes with known latent structure. Models learn factored representations when factors are conditionally independent, and continue to favor them early in training even when noise or hidden dependencies undermine conditional independence, reflecting an inductive bias toward factoring at the cost of fidelity. This provides a principled explanation for why transformers decompose the world into parts, and suggests that interpretable low dimensional structure may persist even in models trained on complex data. |
| title | Transformers learn factored representations |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2602.02385 |