OrtSAE: Orthogonal Sparse Autoencoders Uncover Atomic Features
On the map: Mechanistic interpretability → Sparse autoencoder training and evaluation
Abstract (arXiv)
Sparse autoencoders (SAEs) are a technique for sparse decomposition of neural network activations into human-interpretable features. However, current SAEs suffer from feature absorption, where specialized features capture instances of general features creating representation holes, and feature composition, where independent features merge into composite representations. In this work, we introduce Orthogonal SAE (OrtSAE), a novel approach aimed to mitigate these issues by enforcing orthogonality between the learned features. By implementing a new training procedure that penalizes high pairwise cosine similarity between SAE features, OrtSAE promotes the development of disentangled features while scaling linearly with the SAE size, avoiding significant computational overhead. We train OrtSAE across different models and layers and compare it with other methods. We find that OrtSAE discovers 9% more distinct features, reduces feature absorption (by 65%) and composition (by 15%), improves performance on spurious correlation removal (+6%), and achieves on-par performance for other downstream tasks compared to traditional SAEs.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Placed in Sparse autoencoder training and evaluation, one of 13 directions in Mechanistic interpretability. Builds on 21 of its 28 references that are in the map. First posted on arXiv 26 Sep 2025.
Builds on
21 of 28 references.
Closest ancestors · 6
Same direction, newest first
- 2025Feature Hedging: Correlated Features Break Narrow Sparse Autoencoders16 May
- 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoders21 Mar
- 2025Sparse Autoencoders Do Not Find Canonical Units of Analysis7 Feb
- 2025Automated Interpretability Metrics Do Not Distinguish Trained and Random Transformers29 Jan
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 29 Aug
- 2022Toy Models of Superposition21 Sep
Other references · 15
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
- 2024Scaling and evaluating sparse autoencoderscited by 553
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 435
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 300
- 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 160
- 2024BatchTopK Sparse Autoencoderscited by 130
- 2025SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretabilitycited by 124
- 2024Automatically Interpreting Millions of Features in Large Language Modelscited by 113
- 2015Reducing Overfitting in Deep Networks by Decorrelating Representationscited by 94
- 2024RAVEL: Evaluating Interpretability Methods on Disentangling Language Model Representationscited by 79
Built on by
Citing papers per year: 2026: 8.
8 papers.
- 2026Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?cited by 14
- 2026From Atoms to Trees: Building a Structured Feature Forest with Hierarchical Sparse Autoencoderscited by 6
- 2026Superposition Without Interference? Towards Isolated Interventions via Almost Orthogonal Features in Language Modelscited by 2
- 2026C2R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoderscited by 1
- 2026A Deeper Analysis of Block-Sparse Featurizerscited by 0
- 2026Interference Beyond Geometry in Concept Extractioncited by 0
- 2026When Trees Are Not Enough: Learning Mixed-Topology Feature Graphs with Adaptive Graph Sparse Autoencoderscited by 0
- 2026Towards Fast and Disentangled Counterfactuals for Visual Foundation Modelscited by 0
- 2026Towards Fast and Disentangled Counterfactuals for Visual Foundation Models1 Oct 2026
- 2026When Trees Are Not Enough: Learning Mixed-Topology Feature Graphs with Adaptive Graph Sparse Autoencoders28 Sep 2026
- 2026Interference Beyond Geometry in Concept Extraction28 Sep 2026
- 2026A Deeper Analysis of Block-Sparse Featurizers27 Aug 2026
- 2026C2R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoders29 Jun 2026
- 2026Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?15 Feb 2026
- 2026From Atoms to Trees: Building a Structured Feature Forest with Hierarchical Sparse Autoencoders12 Feb 2026
- 2026Superposition Without Interference? Towards Isolated Interventions via Almost Orthogonal Features in Language Models4 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2025Sparse Autoencoders, Again?
- 2024Evaluating Sparse Autoencoders on Targeted Concept Erasure Tasks
- 2025Sparse Autoencoders Trained on the Same Data Learn Different Features
- 2025SplInterp: Improving our Understanding and Training of Sparse Autoencoders
- 2025Attribution-Guided Distillation of Matryoshka Sparse Autoencoders
- 2025Evaluating and Designing Sparse Autoencoders by Approximating Quasi-Orthogonality
- 2025Evaluating Sparse Autoencoders: From Shallow Design to Matching Pursuit
- 2024SAGE: Scalable Ground Truth Evaluations for Large Sparse Autoencoders