Scaling and evaluating sparse autoencoders
<|reference_start|>Scaling and evaluating sparse autoencoders: Sparse autoencoders provide a promising unsupervised approach for extracting interpretable features from a language model by reconstructing activations from a sparse bottleneck layer. Since language models learn many concepts, autoencoders need to be very large to recover all relevant features. However, studying the properties of autoencoder scaling is difficult due to the need to balance reconstruction and sparsity objectives and the presence of dead latents. We propose using k-sparse autoencoders [Makhzani and Frey, 2013] to directly control sparsity, simplifying tuning and improving the reconstruction-sparsity frontier. Additionally, we find modifications that result in few dead latents, even at the largest scales we tried. Using these techniques, we find clean scaling laws with respect to autoencoder size and sparsity. We also introduce several new metrics for evaluating feature quality based on the recovery of hypothesized features, the explainability of activation patterns, and the sparsity of downstream effects. These metrics all generally improve with autoencoder size. To demonstrate the scalability of our approach, we train a 16 million latent autoencoder on GPT-4 activations for 40 billion tokens. We release training code and autoencoders for open-source models, as well as a visualizer.<|reference_end|>
@article{gao2024scaling,
    title={Scaling and evaluating sparse autoencoders},
    author={Leo Gao, Tom Dupr'e la Tour, Henk Tillman, Gabriel Goh, Rajan Troll,
  Alec Radford, Ilya Sutskever, Jan Leike, Jeffrey Wu},
    journal={arXiv preprint arXiv:2406.04093},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.04093},
    primaryClass={cs.LG cs.AI}
}