Towards a unified and verified understanding of group-operation networks
Not on the map. Why?
Abstract (arXiv)
A recent line of work in mechanistic interpretability has focused on reverse-engineering the computation performed by neural networks trained on the binary operation of finite groups. We investigate the internals of one-hidden-layer neural networks trained on this task, revealing previously unidentified structure and producing a more complete description of such models in a step towards unifying the explanations of previous works (Chughtai et al., 2023; Stander et al., 2024). Notably, these models approximate equivariance in each input argument. We verify that our explanation applies to a large fraction of networks trained on this task by translating it into a compact proof of model performance, a quantitative evaluation of the extent to which we faithfully and concisely explain model internals. In the main text, we focus on the symmetric group S5. For models trained on this group, our explanation yields a guarantee of model accuracy that runs 3x faster than brute force and gives a >=95% accuracy bound for 45% of the models we trained. We were unable to obtain nontrivial non-vacuous accuracy bounds using only explanations from previous works.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 18 of its 29 references that are in the map. First posted on arXiv 9 Oct 2024.
Builds on
18 of 29 references.
References · 18
- 2021Convex optimizationcited by 2,479
- 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,201
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 313
- 2014Understanding image representations by measuring their equivariance and equivalencecited by 240
- 2023The Clock and the Pizza: Two Stories in Mechanistic Explanation of Neural Networkscited by 153
- 2023A Toy Model of Universality: Reverse Engineering How Networks Learn Group Operationscited by 141
- 2018Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernelcited by 131
- 2022Toward Transparent AI: A Survey on Interpreting the Inner Structures of Deep Neural Networkscited by 126
6 more
- 2022The Lie Derivative for Measuring Learned Equivariancecited by 51
- 2023Feature emergence via margin maximization: case studies in algebraic taskscited by 33
- 2023Interpretability Illusions in the Generalization of Simplified Modelscited by 24
- 2023Grokking Group Multiplication with Cosetscited by 22
- 2024Transformer Circuit Faithfulness Metrics are not Robustcited by 18
- 2024Compact Proofs of Model Performance via Mechanistic Interpretabilitycited by 17
Built on by
Citing papers per year: 2025: 2; 2026: 7.
9 papers.
- 2025A Survey on Latent Reasoningcited by 71
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guaranteescited by 10
- 2026Sequential Group Composition: A Window into the Mechanics of Deep Learningcited by 7
- 2025On the geometry and topology of representations: the manifolds of modular additioncited by 3
- 2026Can Neural Networks Learn Small Algebraic Worlds? An Investigation Into the Group-theoretic Structures Learned By Narrow Models Trained To Predict Group Operationscited by 2
- 2026Make Mechanistic Interpretability Auditable: A Call to Develop Guidelines via Continuous Collaborative Reviewingcited by 2
- 2026Grokking From Abstraction to Intelligencecited by 1
- 2026The Rank the Task Demands: A Causal Rank Law for Matrix Memories Trained on Group Compositioncited by 1
- 2026Interactions Between Crosscoder Features: A Compact Proofs Perspectivecited by 0
- 2026The Rank the Task Demands: A Causal Rank Law for Matrix Memories Trained on Group Composition10 Sep 2026
- 2026Interactions Between Crosscoder Features: A Compact Proofs Perspective8 Jun 2026
- 2026Make Mechanistic Interpretability Auditable: A Call to Develop Guidelines via Continuous Collaborative Reviewing24 Apr 2026
- 2026Grokking From Abstraction to Intelligence31 Mar 2026
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees18 Feb 2026
- 2026Sequential Group Composition: A Window into the Mechanics of Deep Learning3 Feb 2026
- 2026Can Neural Networks Learn Small Algebraic Worlds? An Investigation Into the Group-theoretic Structures Learned By Narrow Models Trained To Predict Group Operations29 Jan 2026
- 2025On the geometry and topology of representations: the manifolds of modular addition31 Dec 2025
- 2025A Survey on Latent Reasoning8 Jul 2025