Low-Rank Adapting Models for Sparse Autoencoders
Not on the map. Why?
Abstract (arXiv)
Sparse autoencoders (SAEs) decompose language model representations into a sparse set of linear latent vectors. Recent works have improved SAEs using language model gradients, but these techniques require many expensive backward passes during training and still cause a significant increase in cross entropy loss when SAE reconstructions are inserted into the model. In this work, we improve on these limitations by taking a fundamentally different approach: we use low-rank adaptation (LoRA) to finetune the textitlanguage model itself around a previously trained SAE. We analyze our method across SAE sparsity, SAE width, language model size, LoRA rank, and model layer on the Gemma Scope family of SAEs. In these settings, our method reduces the cross entropy loss gap by 30% to 55% when SAEs are inserted during the forward pass. We also find that compared to end-to-end (e2e) SAEs, our approach achieves the same downstream cross entropy loss 3× to 20× faster on gemma and 2× to 10× faster on llama. We further show that our technique improves downstream metrics and can adapt multiple SAEs at once without harming general language model capabilities. Our results demonstrate that improving model interpretability is not limited to post-hoc SAE training; Pareto improvements can also be achieved by directly optimizing the model itself.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 30 of its 50 references that are in the map. First posted on arXiv 31 Jan 2025.
Builds on
30 of 50 references.
References · 30
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2022Toy Models of Superpositioncited by 928
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 679
- 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 415
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
18 more
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 381
- 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 313
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
- 2013k-Sparse Autoencoderscited by 209
- 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 171
- 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 148
- 2024The Remarkable Robustness of LLMs: Stages of Inference?cited by 138
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoderscited by 133
- 2024BatchTopK Sparse Autoencoderscited by 126
- 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 64
- 2024Recurrent Neural Networks Learn to Store and Generate Sequences using Non-Linear Representationscited by 45
- 2024Decomposing The Dark Matter of Sparse Autoencoderscited by 42
- 2023Seeing is Believing: Brain-Inspired Modular Training for Mechanistic Interpretabilitycited by 38
- 2024Efficient Dictionary Learning with Switch Sparse Autoencoderscited by 38
- 2024Towards Reliable Evaluation of Behavior Steering Interventions in LLMscited by 33
- 2024Monotonic Representation of Numeric Properties in Language Modelscited by 15
- 2024You can remove GPT2's LayerNorm by fine-tuningcited by 11
- 2024Features that Make a Difference: Leveraging Gradients for Improved Dictionary Learningcited by 5
Built on by
Citing papers per year: 2025: 3; 2026: 3.
6 papers.
- 2025Resa: Transparent Reasoning Models via SAEscited by 4
- 2025Revisiting End-To-End Sparse Autoencoder Training: A Short Finetune Is All You Needcited by 3
- 2026Sparse CLIP: Co-Optimizing Interpretability and Performance in Contrastive Learningcited by 2
- 2026Superposition Without Interference? Towards Isolated Interventions via Almost Orthogonal Features in Language Modelscited by 2
- 2025Breaking the Block: Preserving Data Continuity to Train Superior SAEs for Instruct Modelscited by 1
- 2026Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Spacecited by 0
- 2026Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Space29 Sep 2026
- 2026Superposition Without Interference? Towards Isolated Interventions via Almost Orthogonal Features in Language Models4 Feb 2026
- 2026Sparse CLIP: Co-Optimizing Interpretability and Performance in Contrastive Learning27 Jan 2026
- 2025Resa: Transparent Reasoning Models via SAEs11 Jun 2025
- 2025Breaking the Block: Preserving Data Continuity to Train Superior SAEs for Instruct Models9 Jun 2025
- 2025Revisiting End-To-End Sparse Autoencoder Training: A Short Finetune Is All You Need21 Mar 2025