Analysis of Variational Sparse Autoencoders
On the map: Mechanistic interpretability → Sparse autoencoder training and evaluation
Abstract (arXiv)
Sparse Autoencoders (SAEs) have emerged as a promising approach for interpreting neural network representations by learning sparse, human-interpretable features from dense activations. We investigate whether incorporating variational methods into SAE architectures can improve feature organization and interpretability. We introduce the Variational Sparse Autoencoder (vSAE), which replaces deterministic ReLU gating with stochastic sampling from learned Gaussian posteriors and incorporates KL divergence regularization toward a standard normal prior. Our hypothesis is that this probabilistic sampling creates dispersive pressure, causing features to organize more coherently in the latent space while avoiding overlap. We evaluate a TopK vSAE against a standard TopK SAE on Pythia-70M transformer residual stream activations using comprehensive benchmarks including SAE Bench, individual feature interpretability analysis, and global latent space visualization through t-SNE. The vSAE underperforms standard SAE across core evaluation metrics, though excels at feature independence and ablation metrics. The KL divergence term creates excessive regularization pressure that substantially reduces the fraction of living features, leading to observed performance degradation. While vSAE features demonstrate improved robustness, they exhibit many more dead features than baseline. Our findings suggest that naive application of variational methods to SAEs does not improve feature organization or interpretability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Sparse autoencoder training and evaluation, one of 13 directions in Mechanistic interpretability. Builds on 12 of its 23 references that are in the map. First posted on arXiv 26 Sep 2025.
Builds on
12 of 23 references.
Closest ancestors · 2
Same direction, newest first
- 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoders21 Mar
- 2022Toy Models of Superposition21 Sep
Other references · 10
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 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
- 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
- 2025SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretabilitycited by 124
- 2021Transformer visualization via dictionary learning: contextualized embedding as a linear superposition of transformer factorscited by 108
- 2015Sparse Overcomplete Word Vector Representationscited by 44
- 2019Word Embedding Visualization Via Dictionary Learningcited by 12
- 2024Latent Space Characterization of Autoencoder Variantscited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Sparse Autoencoders, Again?
- 2026Improving Robustness In Sparse Autoencoders via Masked Regularization
- 2026Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?
- 2025SplInterp: Improving our Understanding and Training of Sparse Autoencoders
- 2024Features that Make a Difference: Leveraging Gradients for Improved Dictionary Learning
- 2025Evaluating and Designing Sparse Autoencoders by Approximating Quasi-Orthogonality
- 2026Beyond the Hard Budget: Sparsity Regularizers for More Interpretable Top-k Sparse Autoencoders
- 2025Data Whitening Improves Sparse Autoencoder Learning