Understanding AI from the Inside: The State of Mechanistic Interpretability for AI Safety
Organizations: University of Oxford · Martian · Università della Svizzera italiana · Max Planck Institute for Intelligent Systems ·
Abstract
Neural networks are likely to be among the most consequential artefacts in human history. As these systems become more capable and autonomous, their potential to cause societal harm also grows, making AI safety one of the defining challenges of our time. Yet we continue to build increasingly powerful systems without fully understanding how they work, how they will behave in unfamiliar situations, or how to reliably control them. Mechanistic interpretability offers a path towards understanding these systems by studying their internal representations and computations, with the aim of evaluating, predicting, and controlling behaviour. We survey mechanistic interpretability for AI safety in order to answer the question: Does understanding how models work actually make them safer? We place mechanistic interpretability in the broader context of interpretability research and compare its mechanistic evidence with behavioural evaluation. We introduce the foundations of mechanistic interpretability, including features, polysemanticity, transformer computation, and circuits, and survey methods for feature extraction and analysis, circuit discovery and causal verification, explaining intermediate representations in natural language, learning dynamics, and training-data attribution. Beyond surveying existing methods, we propose a unified framework for evaluating mechanistic interpretability claims and characterise six research orientations by their goals, assumptions, and trade-offs. Finally, we examine how mechanistic understanding can support AI safety, including knowledge editing, steering, and monitoring, and assess its limitations, failure modes, open problems, and relationship to behavioural safety measures. We also release a repository of code notebooks with worked examples that reproduce key findings from surveyed methods, allowing readers to build intuition through hands-on experimentation.
Figures & tables
| Dimension | Concept Bottleneck Models | Interpretable-by-Design Models |
|---|---|---|
| Constraint type | Semantic: predefined human concepts | Structural: sparsity, modularity, compositionality |
| Feature discovery | Not possible—concepts fixed a priori | Enabled—model discovers features from data |
| Interpretability guarantee | Explanations in terms of specified concepts | Circuits and features are structurally accessible |
| Accuracy trade-off | Degrades when bottleneck omits relevant features | Degrades with sparsity, but recoverable via scaling |
| Method | Core Idea | Strengths | Intended Use and Limitations |
|---|---|---|---|
| Behavioural (e.g., red-teaming, benchmarks) | Examine model outputs in response to inputs | Fast, scalable, practical for broad safety coverage | Not designed to reveal internal computation; suitable for monitoring, triage, and regression detection |
| Input attribution (e.g., SHAP, saliency) | Identify which inputs most influence outputs | Token-level explanations; scalable | Focuses on input–output influence, not internal mechanisms; useful for auditing and debugging |
| Concept-based (e.g., CBMs, probes) | Correlationally analyse or constrain interpretable representations | Reveals encoded information; transparent abstractions; enables targeted intervention | Not mechanistic without causal intervention; supports localisation, auditing, and early detection tasks |
| Mechanistic (e.g., circuits, SAEs) | Analyse internal computations and causal structure | Reveals algorithms; enables targeted intervention | Computationally intensive; complements other methods when causal understanding is required |
| Layer Type | Variants Used | Reported Basis | Reported Caveats |
|---|---|---|---|
| Residual stream (early layers) | Gated SAE, Top- | Activations are closer to input embeddings; moderate sparsity | Smaller expansion factors (2–4 ) reported |
| Residual stream (middle layers) | Gated SAE, JumpReLU | Richest feature structure; highest interpretability potential | Standard expansion factor (4–8 ); most studied regime |
| Residual stream (late layers) | Top- , Gated SAE | Activations increasingly task-specific; may be less sparse | Larger expansion factors (8–16 ) reported |
| MLP outputs | Transcoder (Section 6.6 ) | MLP applies a nonlinearity a single-layer SAE cannot span | Not a sparse decomposition on a static object; bridges input to output |
| Attention outputs | Gated SAE, standard SAE | Attention outputs often lower-rank | Least studied of the three sites; may benefit from smaller dictionaries |
| Cross-layer | Crosscoder, CLT (Section 6.6 ) | Tracks feature evolution; resolves cross-layer superposition | High compute cost; requires multi-layer training |
| Variant | Reported Finding | Setting |
|---|---|---|
| Standard | Sparse dictionary learning by regularisation recovers features more monosemantic than individual neurons; subject to shrinkage bias | Establishing work, small models ( Cunningham et al., 2024 ; Bricken et al., 2023 ) |
| Gated | Separating detection from magnitude estimation addresses shrinkage at minimal added complexity | Reconstruction–sparsity improvement at matched sparsity, Gemma-family ( Rajamanoharan et al., 2024a ) |
| JumpReLU | Learned per-feature thresholds trained with straight-through estimators give the strongest reported reconstruction | Matched-sparsity comparison, Gemma-family ( Rajamanoharan et al., 2024b ) ; needs most tuning ( Bussmann et al., 2024 ) |
| Top- | A hard constraint removes the sparsity coefficient from the search space | Scaling behaviour characterised on large models; – commonly reported ( Gao et al., 2025 ; Karvonen et al., 2025 ) |
| Batch Top- | A batch-level sparsity budget lets the number of active features vary per input, improving reconstruction at matched average sparsity | Introduced as a relaxation of per-example Top- , achieving better reconstruction ( Bussmann et al., 2024 ) |
| Transcoder | Learning the MLP input–output map avoids spanning the nonlinearity with a single dictionary | Reported to perform at least on par with SAEs ( Dunefsky et al., 2024 ; Paulo et al., 2025c ) |
| Condition | Description |
|---|---|
| Architecture dependence | Most evidence derives from Llama- and Gemma-family models. Generality of the findings across model families remains unestablished. |
| Task dependence | The properties that matter may differ across analysis goals, such as safety auditing, behaviour understanding, and knowledge localisation, but existing evaluations often do not distinguish between them. |
| Rapid iteration | New architectures and training procedures are proposed faster than existing ones are sufficiently studied and replicated. |
| Immature theoretical analysis | Current findings are mostly empirical and may be superseded. Understanding of why particular variants succeed or fail is incomplete. |
| Feature reproducibility | SAEs trained on the same data with different random seeds can recover substantially different features. When between-variant performance differences are smaller than within-variant seed-to-seed variability, we may not confidently attribute them to architectural factors. However, few reported comparisons have rigorously accounted for this concern. |
| Method | Assumption | Strengths | Weaknesses | Best Use Case |
|---|---|---|---|---|
| SAE | Sparse, linear features | Open-ended discovery; fast inference | Hyperparameter-sensitive; identifiability issues | Open-ended feature discovery |
| NMF | Non-negative, additive parts | Parts-based interpretation; uniqueness guarantees | Requires non-negative data; limited sparsity | Naturally non-negative domains |
| PCA | Variance aligns with features | Closed form; optimal low-rank reconstruction | Explains global variance and produces orthogonal features | Small-scale settings; as a baseline method |
| ICA | Complete and independent sources | Theoretical guarantees when assumptions hold | Assumes independence; Gaussian blindness | When independence holds |
| Supervised methods | Known concept labels | High performance on targeted concepts | Requires labels; no discovery | When certain concepts of interest are known |
| K-SVD | Sparse, linear features | Explicitly solving the sparse-coding problem; no encoder bias | Slow inference; no learned encoder | Small, fixed sets of activations; as a baseline method |
| Method | Approach | Interpretability Gain | Primary Limitation |
|---|---|---|---|
| Feature-Sparse Training (SoLU) | Softmax-gated activation function | Increased neuron monosemanticity | Layer normalisation smuggling displaces superposition |
| Weight-Sparse Training | constraint on parameters | More monosemantic neurons and much smaller circuits | Training instability and scalability |
| Attention-Sparse Training | regularisation on attention | Makes attention patterns interpretable | Requires fine-tuning on a trained language model |
| MOLT | Sparse mixture of linear transforms | Reveals implemented operations directly | Complexity of matrix analysis |
| KANs | Learnable splines on edges | Symbolic formula extraction | Scalability to LLMs is unproven |
| Method | Core Idea | Strengths | Limitations |
|---|---|---|---|
| Activation Patching | Intervene on components and measure the resulting output change | Simple and intuitive; provides direct causal evidence | Requires many interventions; component-level granularity can be coarse |
| Path Patching | Intervene on individual information paths or edges and measure their causal effects | Finer-grained localisation of information flow | Computationally expensive due to the large number of candidate paths |
| ACDC | Greedily prune edges from the computational graph while testing whether the target behaviour is preserved | Fully automated; directly searches for a behaviourally sufficient subgraph | Computationally expensive due to sequential edge pruning; sensitive to pruning order and threshold choices |
| EAP | Approximate edge-level attribution using path patching and first-order gradients, enabling parallel evaluation of many candidate edges | Highly parallelisable and computationally efficient; enables large-scale edge attribution | Relies on a first-order approximation; attribution scores may not fully capture nonlinear or interaction effects |
| SAE- or CLT-Based | Discover circuits over sparse, interpretable features rather than raw model components | Leverages interpretable features; enables finer-grained feature-level circuit analysis | Depends on feature quality; requires additional computation to train and analyse SAEs/CLTs |
| Dimension | Definition | Metrics | Methods |
|---|---|---|---|
| Attribution Faithfulness | Do attribution scores accurately reflect the causal effects of the identified components? | Intervention-effect agreement; effect-size error; counterfactual effect recovery | Ablation; activation / path patching; interchange interventions |
| Completeness | How much of the behaviour is accounted for by the identified components? | Loss recovery; behavioural coverage; unexplained variance | Reconstruction; behavioural evaluation; residual analysis |
| Stability | Are findings robust to variations in factors like random seeds, hyperparameters, paraphrases, etc.? | Cross-seed agreement; checkpoint consistency; hyperparameter sensitivity | Multi-seed analysis; checkpoint comparison; input paraphrasing |
| Causal Validity | Are the identified components necessary, sufficient, and specific for the target behaviour? | Necessity score; sufficiency score; specificity score | Ablation; component isolation; interchange interventions; tests with control behaviours |
| Human Interpretability | Can humans understand and use the resulting explanations? | Explanation utility; debugging utility; interpretation agreement | User studies; expert evaluation |
| Method | Attribution Faithfulness | Completeness | Stability | Causal Validity | Human Interpretability |
|---|---|---|---|---|---|
| SAEs and variants | Feature attribution–intervention agreement; effect-size error | Activation reconstruction; loss recovery; unexplained variance | Cross-seed feature alignment | Feature necessity, sufficiency, and specificity | Feature description consistency across annotations, including models and humans |
| Circuit Discovery | Edge or component attribution–intervention agreement; counterfactual recovery | Behavioural coverage; loss or behaviour recovery | Robustness across hyperparameters, seeds, and paraphrases | Circuit necessity, sufficiency, specificity; interchange tests | Circuit-level descriptions; trade-off between sparsity and variance explained |
| Probing | Agreement between probe-derived importance and intervention effects | Coverage across target concepts or behaviours under different distributions | Robustness across seeds and sampled fitting sets | Necessity, specificity, and intervention tests on probe directions | Explanation of shared information in fitting set and search for confounding factors |
| Steering Vectors | Agreement between predicted and observed intervention effects | Coverage across behaviours deemed relevant | Stability across steering magnitudes, seeds, and paraphrases | Intervention efficacy and specificity; side-effect analysis | Explanation of shared information in fitting set and search for confounding factors |
| Appropriate Uses | Inappropriate Uses |
|---|---|
| Establishing information presence (i.e., “ is encoded”) | Claiming causal relevance (i.e., “the model uses ”) |
| Comparing encoding strength across layers | Concluding that a property is not encoded based on low probe accuracy |
| Auditing for encoded sensitive information | Claiming mechanistic understanding from probes alone |
| Generating hypotheses for causal investigation | Using probing results to support hypotheses about causality |
| Early detection or triage before further analysis | Evaluating alignment or safety based on probing results |
| Stage | Automated Role | Human Role | Deliverable |
|---|---|---|---|
| Discovery | Extract candidate features and circuits | Define scope and review methodology | Candidate features and circuits |
| Prioritisation | Rank features and circuits by importance metrics | Review rankings and adjust priorities | Prioritised analysis queue |
| Explanation | Generate explanations at scale | Audit a fraction of samples and review flagged cases | Draft explanations |
| Validation | Run automated consistency and causal checks | Investigate failure modes and validate edge cases | Validated findings |
| Synthesis | Aggregate findings and generate reports | Interpret implications and make decisions | Actionable conclusions |
| Dimension | Pragmatic | Ambitious | Developmental | Across Time | Introspective | Automated |
|---|---|---|---|---|---|---|
| Main Focus | Immediate safety interventions without complete understanding | Complete causal understanding regardless of cost | Developmental processes of representations, mechanisms, and capabilities | Prediction and control of future model behaviour through training dynamics | Introspective models to explain themselves | Scalable discovery via automated pipelines |
| Key Metrics | Performance in proxy tasks | Faithfulness and simulatability | Phase-transition signatures (e.g., LLC) and their correspondence to mechanism formation | Forecasting accuracy and intervention effectiveness | Alignment between self-reports and actual mechanisms | Coverage, scalability, robustness, and faithfulness of analysis |
| Primary Tools | Steering vectors, probes, behavioural evaluation | Circuit discovery, loose-to-strict verification | SLT, loss landscape geometry, representation analysis | Longitudinal analysis, behavioural forecasting, training interventions | Introspective training, activation verbalisers | Circuit discovery, SAEs, LLM agents |
| Expected Time to Impact | Short-term | Long-term | Long-term | Medium | Medium | Short-term |
| Scalability | High | Low | Low | Medium | High | Medium |
| Robustness to Deception | Medium | High | Unknown | Unknown | Low | Low |
| Safety Applications | Descriptions | Prioritised Factors | Promising Methods |
|---|---|---|---|
| Monitoring malicious internal characteristics during inference | Overseeing model activations for hallucination, lying, sycophancy, or other traits considered inappropriate in current inference contexts. | Scalability, robustness | Automated methods such as SAEs and circuit discovery, and scalable methods such as probes |
| Auditing models during evaluation | Discovering and validating potential misalignments, such as reward hacking, misaligned values, planted backdoors, and evaluation awareness. | Recall rate, real cases | Behavioural evaluation, probes, LLM-based automated auditing pipelines |
| Shaping model capabilities and behaviours during training | Preventing the development of certain capabilities, such as biothreat knowledge, and promoting certain behaviours, such as honesty. | Robustness of existence or non-existence | Training data attribution and filtering, training-time interventions, longitudinal analysis, scaling-law analysis |
| Editing misaligned knowledge | Quickly removing or updating knowledge found to be incorrect, outdated, or inappropriate. | Precision, generalisability | Factual knowledge editing methods, concept erasure methods, activation-space analysis such as knowledge representation in low-rank regions |
| Steering models during inference | Steering models away from certain critically harmful behaviours in deployment. | Precision, low compute cost | Steering vectors, prompting |
| Reasoning faithfulness | Testing or validating whether the model’s verbalised explanations for its decision-making process align with actual computations in model activations. | Granularity of analysis | Behavioural tests by counterfactual samples, circuit discovery, activation-space analysis such as activation patching |
| Risk Class | Description | Example | Time Horizon |
|---|---|---|---|
| Epistemic risk | False confidence from incomplete or unfaithful analysis | The report concludes that the circuit for deceptive behaviour has been completely removed, but the model’s backup pathway actually emerged after the removal. | Current |
| Operational risk | MI tools fail silently in deployment | A steering vector is validated to be effective only on a testing set. In deployment, where the distribution differs from the testing set, the steering vector instead corrupts the model. | Near-term |
| Adversarial risk | MI methods enable attacks on the model | Attackers use published knowledge editing methods to inject incorrect knowledge into deployed models. | Current |
| Opportunity cost | Resources diverted from other research directions | Heavy MI investment delays deployment of behavioural safeguards. | Long-term |
Mechanistic Interpretability
Mechanistic interpretability studies how neural networks implement behaviors through internal features, circuits, and causal information flow.
See all 414 papers