The Misery of Mechanistic Interpretability: A Formal Perspective
Not on the map. Why?
Abstract (arXiv)
Mechanistic interpretability has become the dominant lens for understanding frontier language models, as their inner workings are complex and inherently black boxes. To gain insights into these models, interpretable replacement networks (IRNs) are trained at all layers, exposing interpretable features through sparsely activated neurons. However, the faithfulness of an IRN is usually evaluated only empirically on clean data, and we show that even semantically minor input perturbations flip the dominant IRN features-and thus the human-understandable interpretation-across five open-weight model families (GPT-2 small, Gemma 2 2B, Gemma 3 1B, Llama 3.2 1B, R1-Distill-Qwen 1.5B). We propose the first formal verification framework for the faithfulness of an IRN, where reachability analysis certifies a sound upper bound of the faithfulness gap in adversarial scenarios. Moreover, we show that verification-aware training of IRNs substantially tightens this certified bound, restoring a feature-level interpretation that safety auditors can act on. Together, these results give, to the best of our knowledge, the first formal guarantees for mechanistic interpretability of large language models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 48 of its 65 references that are in the map. First posted on arXiv 14 Sep 2026.
Builds on
48 of 65 references.
References · 48
- 2017Attention Is All You Needcited by 59,932
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2025Gemma 3 Technical Reportcited by 1,686
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
36 more
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2022Toy Models of Superpositioncited by 928
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 679
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 415
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 381
- 2023Explainability for Large Language Models: A Surveycited by 331
- 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 328
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
- 2023Certifying LLM Safety against Adversarial Promptingcited by 248
- 2023Causal Abstraction: A Theoretical Foundation for Mechanistic Interpretabilitycited by 194
- 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
- 2026Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnetcited by 175
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoderscited by 133
- 2024Automatically Interpreting Millions of Features in Large Language Modelscited by 106
- 2025Sparse Autoencoders Trained on the Same Data Learn Different Featurescited by 86
- 2024Safeguarding Large Language Models: A Surveycited by 73
- 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 64
- 2021On Guaranteed Optimal Robust Explanations for NLP Modelscited by 54
- 2022Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networkscited by 42
- 2025Weight-sparse transformers have interpretable circuitscited by 40
- 2022VeriX: Towards Verified Explainability of Deep Neural Networkscited by 30
- 2025Automated Interpretability Metrics Do Not Distinguish Trained and Random Transformerscited by 30
- 2025The 6th International Verification of Neural Networks Competition (VNN-COMP 2025): Summary and Resultscited by 26
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanationscited by 13
- 2025Evaluating Adversarial Robustness of Concept Representations in Sparse Autoencoderscited by 11
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guaranteescited by 10
- 2026Arithmetic in the Wild: Llama uses Base-10 Addition to Reason About Cyclic Conceptscited by 9
- 2023Fully Automatic Neural Network Reduction for Formal Verificationcited by 6
- 2024Set-Based Training for Neural Network Verificationcited by 6
- 2025Out of the Shadows: Exploring a Latent Space for Neural Network Verificationcited by 6
Built on by
Not cited yet.