The Local Interaction Basis: Identifying Computationally-Relevant and Sparsely Interacting Features in Neural Networks
On the map: Mechanistic interpretability → Circuits and mechanistic analysis
Abstract (arXiv)
Mechanistic interpretability aims to understand the behavior of neural networks by reverse-engineering their internal computations. However, current methods struggle to find clear interpretations of neural network activations because a decomposition of activations into computational features is missing. Individual neurons or model components do not cleanly correspond to distinct features or functions. We present a novel interpretability method that aims to overcome this limitation by transforming the activations of the network into a new basis - the Local Interaction Basis (LIB). LIB aims to identify computational features by removing irrelevant activations and interactions. Our method drops irrelevant activation directions and aligns the basis with the singular vectors of the Jacobian matrix between adjacent layers. It also scales features based on their importance for downstream computation, producing an interaction graph that shows all computationally-relevant features and interactions in a model. We evaluate the effectiveness of LIB on modular addition and CIFAR-10 models, finding that it identifies more computationally-relevant features that interact more sparsely, compared to principal component analysis. However, LIB does not yield substantial improvements in interpretability or interaction sparsity when applied to language models. We conclude that LIB is a promising theory-driven approach for analyzing neural networks, but in its current form is not applicable to large language models.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 21 of its 48 references that are in the map. First posted on arXiv 17 May 2024.
Builds on
21 of 48 references.
Closest ancestors · 4
Same direction, newest first
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretability28 Apr
- 2023A Toy Model of Universality: Reverse Engineering How Networks Learn Group Operations6 Feb
- 2023Progress measures for grokking via mechanistic interpretability12 Jan
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small1 Nov
Other references · 17
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2022Toy Models of Superpositioncited by 971
- 2018Disentangling by Factorisingcited by 616
- 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 449
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 435
- 2021Causal Abstractions of Neural Networkscited by 422
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 319
- 2023Localizing Model Behavior with Path Patchingcited by 195
- 2020Causal Mediation Analysis for Interpreting Neural NLP: The Case of Gender Biascited by 191
5 more
- 2023The Clock and the Pizza: Two Stories in Mechanistic Explanation of Neural Networkscited by 156
- 2016Multifaceted Feature Visualization: Uncovering the Different Types of Features Learned By Each Neuron in Deep Neural Networkscited by 106
- 2020The Hessian Penalty: A Weak Prior for Unsupervised Disentanglementcited by 92
- 2015How far can we go without convolution: Improving fully-connected networkscited by 20
- 2020Explaining Neural Networks by Decoding Layer Activationscited by 13
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 4.
8 papers.
- 2024InterpBench: Semi-Synthetic Transformers for Evaluating Mechanistic Interpretability Techniquescited by 25
- 2025Transformers Don't Need LayerNorm at Inference Time: Scaling LayerNorm Removal to GPT-2 XL and the Implications for Mechanistic Interpretabilitycited by 7
- 2025Feature Identification via the Empirical NTKcited by 4
- 2026Mechanistically Eliciting Latent Behaviors in Language Modelscited by 3
- 2024Weight-based Decomposition: A Case for Bilinear MLPscited by 2
- 2026An Analysis of Residual-Stream Geometry Across Transformer Depthcited by 1
- 2026Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decompositioncited by 0
- 2026RouterInterp: Understanding Superposed Specialisation in Mixture of Experts Routingcited by 0
- 2026RouterInterp: Understanding Superposed Specialisation in Mixture of Experts Routing8 Oct 2026
- 2026An Analysis of Residual-Stream Geometry Across Transformer Depth20 Jul 2026
- 2026Mechanistically Eliciting Latent Behaviors in Language Models28 Jun 2026
- 2026Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decomposition19 Jan 2026
- 2025Feature Identification via the Empirical NTK1 Oct 2025
- 2025Transformers Don't Need LayerNorm at Inference Time: Scaling LayerNorm Removal to GPT-2 XL and the Implications for Mechanistic Interpretability3 Jul 2025
- 2024InterpBench: Semi-Synthetic Transformers for Evaluating Mechanistic Interpretability Techniques19 Jul 2024
- 2024Weight-based Decomposition: A Case for Bilinear MLPs6 Jun 2024
Similar, not cited
Close in wording, no citation either way
- 2026Interpreting Language Model Parameters
- 2025MIB: A Mechanistic Interpretability Benchmark
- 2024A Practical Review of Mechanistic Interpretability for Transformer-Based Language Models
- 2026Beyond Activation Patterns: A Weight-Based Out-of-Context Explanation of Sparse Autoencoder Features
- 2025Constructing Interpretable Features from Compositional Neuron Groups
- 2025SCALAR: Benchmarking SAE Interaction Sparsity in Toy LLMs
- 2025Predictive Concept Decoders: Training Scalable End-to-End Interpretability Assistants
- 2026Interactions Between Crosscoder Features: A Compact Proofs Perspective