Sparse Autoencoders › Summary

Sparse autoencoders address the polysemanticity problem in language models by decomposing dense, entangled activation vectors into sparse combinations of interpretable features. The architecture is simple: an overcomplete encoder that maps activations to a larger space via ReLU, and a linear decoder with unit-norm columns. Training optimizes a reconstruction loss plus an $L_1$ sparsity penalty, learning a dictionary of features such that any activation is approximately a sparse linear combination of dictionary vectors.

The core ideas build on decades of work in sparse coding, neuroscience, and dictionary learning. What makes SAEs novel as an interpretability tool is the combination of scale (billion-token training runs on frontier language models), the empirical finding that the learned features are often monosemantic and human-interpretable, and the connection to the superposition hypothesis that provides a theoretical framework for why language models should have sparse, approximately-orthogonal internal feature representations in the first place.

Key takeaways from this chapter:

• Superposition and polysemanticity are the motivation: language models represent more features than they have neurons by packing multiple concepts per neuron, making individual neurons hard to interpret.
• SAE architecture uses an overcomplete dictionary ($m \gg d$) with a ReLU encoder and normalized decoder columns. The encoder and decoder are untied, allowing separate optimization of feature detection and reconstruction.
• The training loss combines MSE reconstruction with $L_1$ sparsity ($\lambda \| \mathbf{z} \|_1$), with $\lambda$ controlling the sparsity-fidelity tradeoff. The $L_1$ norm is used because $L_0$ minimization is NP-hard and non-differentiable.
• Dictionary learning is the classical framework SAEs draw from. The ReLU encoder is an amortized approximation to sparse coding, enabling efficient training at scale while sacrificing some optimality.
• Dead features are a key practical challenge. Solutions include neuron resampling, auxiliary loss, and TopK activation, with TopK increasingly preferred for large-scale training.
• Evaluation combines quantitative metrics (variance explained, loss recovered) with qualitative inspection of top-activating examples. Loss recovered is more meaningful than $R^2$ because it measures preservation of task-relevant information.
• Limitations include faithfulness concerns, feature splitting, the basis non-uniqueness problem, training instability, and the unverified assumption of the superposition hypothesis.
• Large-scale SAE results have revealed millions of interpretable features in frontier language models, giving the most detailed maps of language model representations available today, and opening new directions for understanding and auditing AI systems.