On the geometry and topology of representations: the manifolds of modular addition
Not on the map. Why?
Abstract (arXiv)
The Clock and Pizza interpretations, associated with architectures differing in either uniform or learnable attention, were introduced to argue that different architectural designs can yield distinct circuits for modular addition. In this work, we show that this is not the case, and that both uniform attention and trainable attention architectures implement the same algorithm via topologically and geometrically equivalent representations. Our methodology goes beyond the interpretation of individual neurons and weights. Instead, we identify all of the neurons corresponding to each learned representation and then study the collective group of neurons as one entity. This method reveals that each learned representation is a manifold that we can study utilizing tools from topology. Based on this insight, we can statistically analyze the learned representations across hundreds of circuits to demonstrate the similarity between learned modular addition circuits that arise naturally from common deep learning paradigms.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 42 references that are in the map. First posted on arXiv 31 Dec 2025.
Builds on
26 of 42 references.
References · 26
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2022Toy Models of Superpositioncited by 971
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2024The Platonic Representation Hypothesiscited by 382
- 2015Convergent Learning: Do different neural networks learn the same representations?cited by 220
- 2023The Clock and the Pizza: Two Stories in Mechanistic Explanation of Neural Networkscited by 156
- 2023A Toy Model of Universality: Reverse Engineering How Networks Learn Group Operationscited by 144
- 2019Ripser: efficient computation of Vietoris-Rips persistence barcodescited by 117
- 2023Grokking modular arithmeticcited by 83
- 2024Asymptotic theory of in-context learning by linear attentioncited by 55
- 2014Domain Adaptive Neural Networks for Object Recognitioncited by 52
14 more
- 2024Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic taskscited by 40
- 2023Feature emergence via margin maximization: case studies in algebraic taskscited by 33
- 2023To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasetscited by 24
- 2023Grokking Group Multiplication with Cosetscited by 24
- 2024Fourier Circuits in Neural Networks and Transformers: A Case Study of Modular Arithmetic with Multiple Inputscited by 22
- 2022MMD-B-Fair: Learning Fair Representations with Statistical Testingcited by 13
- 2024Towards a unified and verified understanding of group-operation networkscited by 10
- 2025Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networkscited by 10
- 2025Fair Representation Learning for Continuous Sensitive Attributes using Expectation of Integral Probability Metricscited by 7
- 2025(How) Can Transformers Predict Pseudo-Random Numbers?cited by 6
- 2017Can Deep Reinforcement Learning Solve Erdos-Selfridge-Spencer Games?cited by 5
- 2025Position: We Need An Algorithmic Understanding of Generative AIcited by 5
- 2024Modular addition without black-boxes: Compressing explanations of MLPs that compute numerical integrationcited by 3
- 2022Topological Data Analysis of Neural Network Layer Representationscited by 1
Built on by
Citing papers per year: 2026: 3.
3 papers.