Sparse Autoencoders for Mechanistic Interpretability in NLP: A Critical Survey of Recoverability, Interpretability, and Utility
Organizations: Department of Computer Science (DCS), University of Luxembourg
Abstract
Sparse autoencoders (SAEs) have emerged as a promising approach to mechanistic interpretability by decomposing language-model activations into sparse, potentially interpretable features. However, differences in design assumptions, evaluation objectives, and experimental settings complicate conclusions about their effectiveness. We present a critical survey of 138 studies on SAEs in natural language processing. Our contributions are fourfold: (1) we propose a task-grounded taxonomy connecting dictionary design, feature operations, and NLP functions; (2) we examine how sparsity allocation, geometry, data coverage, and inference affect feature recoverability; (3) we assess evidence for semantic interpretability, mechanistic faithfulness, and behavioral utility; and (4) we synthesize findings across multilingual processing, retrieval, reasoning, classification, and behavioral regulation, highlighting the roles of objectives, baselines, supervision, and intervention pipelines. Through comparative analyses of published results, we reconcile apparent disagreements, identify unresolved questions, and propose directions for more rigorous evaluation. An anonymous research register https://anonymous.4open.science/r/sae-research-register-C331/register.html accompanies the survey.
Figures & tables
| Claim | Weak evidence | Moderate evidence | Stronger evidence |
|---|---|---|---|
| Feature description | A label supported only by selected activating examples. | The description predicts feature activation on unseen positive and negative examples. | Tests with hard negatives and counterexamples; the description distinguishes the feature from similar features. |
| Prediction / diagnosis | Correlation observed on training data. | Predictive performance on held-out data, compared with a relevant baseline. | Generalization and calibration tests; matched supervision and checks for confounding or data leakage. |
| Mechanistic role | Feature coactivation or behavioral changes without adequate controls. | A targeted intervention produces the predicted behavioral effect. | Semantic counterfactuals, reconstruction-error controls, and tests of alternative computational pathways or circuit dependencies. |
| Task control | A few selected examples of successful behavior modification. | Task improvement over a baseline, with effects on other capabilities assessed. | Matched feature-selection and control baselines, with robustness, side effects, and persistence evaluated. |
| SAE use | Information used | Reported contribution | Key evaluation distinction |
|---|---|---|---|
| Hallucination detection and feedback ( Chen et al., 2026a ; Xiong et al., 2026 ) | Sparse features and detection signals; feedback adds a generation stage. | Detect unsupported answers and guide subsequent generation. | Evaluate detection and generation improvements separately. |
| Context–memory selection ( Xin et al., 2025 ; Zhao et al., 2025b ) | Features identified through contrasts between retrieved context and internal knowledge. | Change which information source the model relies on. | Measure source preference and answer correctness separately. |
| Query enrichment ( Abdaljalil et al., 2025 ; Dong et al., 2026 ) | SAE-guided query modifications; some analyses select successful query expansions. | Improve retrieval/generation or analyze query-expansion effects. | Test on unselected queries and evaluate the contribution of the SAE within the full pipeline. |
| Distractor repair ( Giannetti et al., 2026 ) | Known correct answer token used to optimize latent activations on selected difficult examples. | Recover answers affected by distracting documents. | Distinguish oracle-assisted repair from autonomous error correction. |
Appendix figures & tables9 assets
Supplementary material from the paper’s appendix.
Appendix
| Code | Category | Assignment criterion | Boundary or clarification |
| Dictionary design (D) | |||
| A | Adopted/comparative | Uses or compares an existing dictionary; dictionary construction is not the main contribution. | Does not imply a new SAE architecture. |
| B | Budget/amplitude | Changes sparsity allocation or separates feature selection from activation magnitude. | Using a TopK checkpoint alone does not qualify. |
| G | Geometry/structure | Changes feature geometry, grouping, hierarchy, signs, or relational constraints. | A semantic label does not establish a multidimensional representation. |
| C | Coverage/objective | Changes training-data coverage or the objective determining what is preserved. | Task-specific supervision is recorded separately. |
| I | Inference/site/sharing | Changes sparse-code inference, activation sites, or parameter sharing. | Choosing a layer for an application is not necessarily a design contribution. |
| Ambiguous case | Coding decision | Why the distinction matters | Examples |
|---|---|---|---|
| Hybrid SAE–classifier | Design: objective; operations: describe, predict, construct; function: text analytics. | An interpretable task-specific classifier does not necessarily explain the original language model. | DILA and task-specific classification ( Wu et al., 2024 ; Bail et al., 2025 ) . |
| Transcoder | Design: functional alternative; operations: trace, characterize. | A transcoder approximates an input–output mapping rather than reconstructing the same activation. | Transcoder methods ( Dunefsky et al., 2024 ; Paulo et al., 2025 ) . |
| Sparse model diffing | Operations: describe, diagnose; functions: adaptation, regulation. | Analyzing changes after an update differs from predicting their effects before training. | MNEME and transfer prediction ( Kassem et al., 2025 ; Zhang et al., 2026b ) . |
| SAE-informed data selection | Operation: construct; function: adaptation or multimodal extension. | Selecting training data changes the resulting system; feature analysis is a separate step. | IGDS and data filtering ( Shi et al., 2026 ; Das et al., 2026 ) . |
| Feature-guided steering | Operation: edit; adopted dictionary unless its design is modified. | Performance gains may depend on feature selection, optimization, or gating rather than the dictionary alone. | FGAA and REINS ( Soo et al., 2025 ; Ding et al., 2026 ) . |
| Coactivation modules | Operations: characterize, edit; no automatic tracing label. | Coactivation and group interventions do not establish directed computational dependencies. | Coactivation modules ( Deng et al., 2026 ) . |
| Method | Allocation strategy | Evidence and setting | Implication for recoverability |
|---|---|---|---|
| TopK ( Gao et al., 2025 ) | Selects a fixed number of activations per input. | Evaluated through dictionary scaling, reconstruction, and behavioral preservation. | A fixed budget may be insufficient for complex inputs or excessive for simple ones. |
| BatchTopK ( Bussmann et al., 2024 ) | Selects activations across a batch; uses an estimated threshold at inference. | GPT-2 Small and Gemma-2-2B. Improved reconstruction over TopK; mixed downstream cross-entropy results against JumpReLU. | Reconstruction gains do not guarantee better behavioral preservation or semantic interpretability. |
| Top-AFA ( Lee et al., 2025 ) | Adapts the number of active features using a quasi-orthogonality-based magnitude approximation. | Theoretical approximation bounds and GPT-2 experiments on OpenWebText. | Adaptive sparsity can follow geometric assumptions without a learned complexity predictor. |
| AdaptiveK ( Yao et al., 2026 ) | Predicts input complexity to determine the sparsity budget. | Empirical evaluations of complexity-dependent allocation and downstream behavior. | Adaptive allocation does not by itself establish recovery of meaningful semantic features. |
| GBA ( Chen et al., 2026b ) | Adapts feature activation frequencies across groups under specified coverage assumptions. | Synthetic feature-recovery experiments; performance depends on frequency coverage (Appendix F ). | Recovery depends on coverage assumptions; synthetic results do not establish NLP generalization. |
| Method / design | Key assumption or change | Reported evidence | Implication or limitation |
|---|---|---|---|
| Gated / JumpReLU SAEs ( Rajamanoharan et al., 2024a ; Rajamanoharan et al., 2024b ) | Separate feature selection from activation magnitude, or use learned activation thresholds. | Improvements in sparsity and reconstruction under the respective training objectives. | Reducing shrinkage does not guarantee recovery of the intended semantic features. |
| Signed / subspace features ( Zhu et al., 2026 ; Dalili and Mahdavi, 2026 ; Engels et al., 2025 ) | Represent concepts using signed coordinates or multidimensional subspaces instead of single nonnegative features. | Investigations of feature polarity, distributed concepts, and multidimensional geometry. | Comparisons must account for feature dimensionality and representation capacity. |
| Hierarchy / composition ( Bussmann et al., 2025 ; Muchane et al., 2025 ; Kurochkin et al., 2025 ) | Introduce nested dictionaries, parent–child dependencies, or compositional feature structures. | Methods for representing multiple feature scales, hierarchies, or compositions. | Learned hierarchies do not necessarily correspond to linguistic structures or causal circuits. |
| Weighted SAE (WSAE) ( Cui et al., 2026 ) | Analyzes recovery under specified geometric, sparsity, and tied-weight assumptions. | Theoretical recovery results under an idealized generative model. | Recovery guarantees do not automatically extend to real language-model activations. |
| Geometry-oriented theory ( Hindupur et al., 2025 ) | Relates feature recovery to concept geometry and the reconstruction model. | Identifies conditions under which particular concept structures are recoverable. | Recovering a geometric structure does not establish its linguistic meaning. |
| Local Amortized SAE (LocA-SAE) ( Sun et al., 2026 ) | Addresses the gap between shared-encoder predictions and per-input sparse inference. | Gemma-2-2B experiments with iterative inference, including a 200-step ISTA reference. | Improved inference does not establish recovery of ground-truth semantic features. |
| Scientific claim | Reported evidence | What can be concluded | Further validation |
|---|---|---|---|
| Features represent abstract reasoning | Reasoning-related activations; cue-injection and meaning-preserving tests ( Galichin et al., 2025 ; Ma et al., 2026 ) . | Activation patterns alone do not establish abstract reasoning; counterexamples can weaken the interpretation. | Test semantic contrasts independently of control utility. |
| Feature descriptions identify distinct features | Descriptions predict activations but may also fit unrelated features ( McCann, 2026 ) . | A plausible description does not necessarily distinguish one feature from another. | Use hard negatives and neighboring-feature discrimination. |
| Successful patching reveals a mechanism | A patch can reproduce an output through disconnected and dormant components ( Makelov et al., 2024 ) . | A causal intervention need not recover the model’s natural computation. | Test natural pathways and component-specific effects. |
| Sparse circuits explain grammatical behavior | Feature/error circuits with controlled interventions on agreement tasks ( Marks et al., 2025 ) . | Provides evidence for a mechanistic role within the tested setting. | Test transfer across tasks, contexts, and distributions. |
| SAEs improve classification | Positive task-specific and pooled representations; mixed generic probing results ( Gallifant et al., 2025 ; Bail et al., 2025 ; Kantamneni et al., 2025 ) . | Benefits depend on the representation, supervision, and classification pipeline. | Match feature selection, pooling, model capacity, and baselines. |
| SAEs enable safe knowledge removal | Forgetting results under different populations, controllers, and retention tests ( Farrell et al., 2024 ; Muhamed et al., 2025a ; Ashuach et al., 2026 ) . | Unmatched results do not establish a general forgetting–retention advantage. | Compare selected populations, retention, intervention type, and relearning. |
Sparse Autoencoders
Sparse autoencoders decompose neural network activations into sparse features to study, interpret, and control learned representations.
See all 217 papers