Opening the AI black box: program synthesis via mechanistic interpretability
Not on the map. Why?
Abstract (arXiv)
We present MIPS, a novel method for program synthesis based on automated mechanistic interpretability of neural networks trained to perform the desired task, auto-distilling the learned algorithm into Python code. We test MIPS on a benchmark of 62 algorithmic tasks that can be learned by an RNN and find it highly complementary to GPT-4: MIPS solves 32 of them, including 13 that are not solved by GPT-4 (which also solves 30). MIPS uses an integer autoencoder to convert the RNN into a finite state machine, then applies Boolean or integer symbolic regression to capture the learned algorithm. As opposed to large language models, this program synthesis technique makes no use of (and is therefore not limited by) human training data such as algorithms and code from GitHub. We discuss opportunities and challenges for scaling up this approach to make machine-learned models more interpretable and trustworthy.
Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). Builds on 26 of its 36 references that are in the map. First posted on arXiv 7 Feb 2024.
Builds on
26 of 36 references.
References · 26
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2022In-context Learning and Induction Headscited by 930
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2022Discovering Latent Knowledge in Language Models Without Supervisioncited by 733
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetscited by 673
- 2022Emergent World Representations: Exploring a Sequence Model Trained on a Synthetic Taskcited by 417
- 2020Discovering Symbolic Models from Deep Learning with Inductive Biasescited by 335
- 2023Language Models Represent Space and Timecited by 306
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
14 more
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
- 2023Attribution Patching Outperforms Automated Circuit Discoverycited by 196
- 2023The Clock and the Pizza: Two Stories in Mechanistic Explanation of Neural Networkscited by 153
- 2020AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularitycited by 140
- 2021Acquisition of Chess Knowledge in AlphaZerocited by 120
- 2023Tracr: Compiled Transformers as a Laboratory for Interpretabilitycited by 99
- 2021Chess as a Testbed for Language Model State Trackingcited by 69
- 2023Understanding Addition in Transformerscited by 34
- 2023Learning the greatest common divisor: explaining transformer predictionscited by 33
- 2020BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided Explorationcited by 30
- 2023Provably safe systems: the only path to controllable AGIcited by 29
- 2021Choose Your Programming Copilot: A Comparison of the Program Synthesis Performance of GitHub Copilot and Genetic Programmingcited by 24
- 2022Evolving symbolic density functionalscited by 19
- 2023Programming by Example Made Easycited by 2
Built on by
Citing papers per year: 2024: 8; 2025: 4; 2026: 7.
19 papers.
Sort:
By area:
- 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 415
- 2024Not All Language Model Features Are One-Dimensionally Linearcited by 201
- 2024Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systemscited by 94
- 2025Towards Understanding Distilled Reasoning Models: A Representational Approachcited by 26
- 2024Meta-Designing Quantum Experiments with Language Modelscited by 12
- 2025Emergent Symbol-like Number Variables in Artificial Neural Networkscited by 5
- 2024TracrBench: Generating Interpretability Testbeds with Large Language Modelscited by 4
- 2024Investigating Representation Universality: Case Study on Genealogical Representationscited by 4
- 2025Harmonic Loss Trains Interpretable AI Modelscited by 4
- 2024Rethinking the Relationship between Recurrent and Non-Recurrent Neural Networks: A Study in Sparsitycited by 3
- 2026CodeCircuit: Toward Inferring LLM-Generated Code Correctness via Attribution Graphscited by 3
- 2024Weight-based Decomposition: A Case for Bilinear MLPscited by 2
7 more
- 2026Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformercited by 2
- 2026From I/O to Code with Discovery Agentcited by 1
- 2026Explaining Attention with Program Synthesiscited by 1
- 2025Algorithm Development in Neural Networks: Insights from the Streaming Parity Taskcited by 0
- 2026Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decompositioncited by 0
- 2026Characterize Then Distill: Mechanistic Reasoning in Large Output Spacescited by 0
- 2026Interpreting Neural Combinatorial Optimization via Evolving Programmatic Bottleneckscited by 0
- 2026Interpreting Neural Combinatorial Optimization via Evolving Programmatic Bottlenecks18 Jun 2026
- 2026Explaining Attention with Program Synthesis17 Jun 2026
- 2026Characterize Then Distill: Mechanistic Reasoning in Large Output Spaces5 Jun 2026
- 2026From I/O to Code with Discovery Agent14 May 2026
- 2026CodeCircuit: Toward Inferring LLM-Generated Code Correctness via Attribution Graphs6 Feb 2026
- 2026Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decomposition19 Jan 2026
- 2026Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer9 Jan 2026
- 2025Algorithm Development in Neural Networks: Insights from the Streaming Parity Task14 Jul 2025
- 2025Towards Understanding Distilled Reasoning Models: A Representational Approach5 Mar 2025
- 2025Harmonic Loss Trains Interpretable AI Models3 Feb 2025
- 2025Emergent Symbol-like Number Variables in Artificial Neural Networks10 Jan 2025
- 2024Investigating Representation Universality: Case Study on Genealogical Representations10 Oct 2024
7 more
- 2024TracrBench: Generating Interpretability Testbeds with Large Language Models7 Sep 2024
- 2024Weight-based Decomposition: A Case for Bilinear MLPs6 Jun 2024
- 2024Meta-Designing Quantum Experiments with Language Models4 Jun 2024
- 2024Not All Language Model Features Are One-Dimensionally Linear23 May 2024
- 2024Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems10 May 2024
- 2024Mechanistic Interpretability for AI Safety -- A Review22 Apr 2024
- 2024Rethinking the Relationship between Recurrent and Non-Recurrent Neural Networks: A Study in Sparsity1 Apr 2024
- 2026From I/O to Code with Discovery Agentcited by 1
- 2026From I/O to Code with Discovery Agent14 May 2026
- 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 415
- 2024Not All Language Model Features Are One-Dimensionally Linearcited by 201
- 2024Meta-Designing Quantum Experiments with Language Modelscited by 12
- 2025Emergent Symbol-like Number Variables in Artificial Neural Networkscited by 5
- 2024TracrBench: Generating Interpretability Testbeds with Large Language Modelscited by 4
- 2024Investigating Representation Universality: Case Study on Genealogical Representationscited by 4
- 2025Harmonic Loss Trains Interpretable AI Modelscited by 4
- 2024Rethinking the Relationship between Recurrent and Non-Recurrent Neural Networks: A Study in Sparsitycited by 3
- 2026CodeCircuit: Toward Inferring LLM-Generated Code Correctness via Attribution Graphscited by 3
- 2024Weight-based Decomposition: A Case for Bilinear MLPscited by 2
- 2026Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformercited by 2
- 2026Explaining Attention with Program Synthesiscited by 1
12 most cited of 15 All 15 (JSON)
- 2026Interpreting Neural Combinatorial Optimization via Evolving Programmatic Bottlenecks18 Jun 2026
- 2026Explaining Attention with Program Synthesis17 Jun 2026
- 2026CodeCircuit: Toward Inferring LLM-Generated Code Correctness via Attribution Graphs6 Feb 2026
- 2026Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decomposition19 Jan 2026
- 2026Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer9 Jan 2026
- 2025Algorithm Development in Neural Networks: Insights from the Streaming Parity Task14 Jul 2025
- 2025Harmonic Loss Trains Interpretable AI Models3 Feb 2025
- 2025Emergent Symbol-like Number Variables in Artificial Neural Networks10 Jan 2025
- 2024Investigating Representation Universality: Case Study on Genealogical Representations10 Oct 2024
- 2024TracrBench: Generating Interpretability Testbeds with Large Language Models7 Sep 2024
- 2024Weight-based Decomposition: A Case for Bilinear MLPs6 Jun 2024
- 2024Meta-Designing Quantum Experiments with Language Models4 Jun 2024
12 newest of 15 All 15 (JSON)