mlsanityData to 7 Oct 2026

Analyzing (In)Abilities of SAEs via Formal Languages

arXiv 2410.11767 ↗First posted 15 Oct 2024cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

Autoencoders have been used for finding interpretable and disentangled features underlying neural network representations in both image and text domains. While the efficacy and pitfalls of such methods are well-studied in vision, there is a lack of corresponding results, both qualitative and quantitative, for the text domain. We aim to address this gap by training sparse autoencoders (SAEs) on a synthetic testbed of formal languages. Specifically, we train SAEs on the hidden representations of models trained on formal languages (Dyck-2, Expr, and English PCFG) under a wide variety of hyperparameter settings, finding interpretable latents often emerge in the features learned by our SAEs. However, similar to vision, we find performance turns out to be highly sensitive to inductive biases of the training pipeline. Moreover, we show latents correlating to certain features of the input do not always induce a causal impact on model's computation. We thus argue that causality has to become a central target in SAE training: learning of causal features should be incentivized from the ground-up. Motivated by this, we propose and perform preliminary investigations for an approach that promotes learning of causally relevant features in our formal language setting.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 28 of its 46 references that are in the map. First posted on arXiv 15 Oct 2024.

Builds on

28 of 46 references.

References · 28

  1. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
  2. 2023Inference-Time Intervention: Eliciting Truthful Answers from a Language Modelcited by 1,259
  3. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  4. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
  5. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  6. 2024Scaling and evaluating sparse autoencoderscited by 530
  7. 2022Emergent World Representations: Exploring a Sequence Model Trained on a Synthetic Taskcited by 417
  8. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
  9. 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 381
  10. 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 278
  11. 2024Chain of Thought Empowers Transformers to Solve Inherently Serial Problemscited by 256
  12. 2020Weakly-Supervised Disentanglement Without Compromisescited by 237
16 more
  1. 2021Towards Causal Representation Learningcited by 207
  2. 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 171
  3. 2020Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse Codingcited by 121
  4. 2020CausalWorld: A Robotic Manipulation Benchmark for Causal Structure and Transfer Learningcited by 109
  5. 2020On Disentangled Representations Learned From Correlated Datacited by 94
  6. 2022Linear Causal Disentanglement via Interventionscited by 84
  7. 2023Physics of Language Models: Part 1, Learning Hierarchical Language Structurescited by 83
  8. 2024Towards Principled Evaluations of Sparse Autoencoders for Interpretability and Controlcited by 83
  9. 2019Weakly Supervised Disentanglement with Guaranteescited by 82
  10. 2023How Deep Neural Networks Learn Compositional Data: The Random Hierarchy Modelcited by 70
  11. 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 64
  12. 2024What Makes and Breaks Safety Fine-tuning? A Mechanistic Studycited by 54
  13. 2022Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learningcited by 44
  14. 2024Evaluating Open-Source Sparse Autoencoders on Disentangling Factual Knowledge in GPT-2 Smallcited by 34
  15. 2023Transformers are uninterpretable with myopic methods: a case study with bounded Dyck grammarscited by 30
  16. 2024A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Languagecited by 26

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 12; 2026: 4.

16 papers.

Sort:

By area: