mlsanityData to 7 Oct 2026

Binary Sparse Coding for Interpretability

arXiv 2509.25596 ↗First posted 29 Sep 2025cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Sparse autoencoders (SAEs) are used to decompose neural network activations into sparsely activating features, but many SAE features are only interpretable at high activation strengths. To address this issue we propose to use binary sparse autoencoders (BAEs) and binary transcoders (BTCs), which constrain all activations to be zero or one. We find that binarisation significantly improves the interpretability and monosemanticity of the discovered features, while increasing reconstruction error. By eliminating the distinction between high and low activation strengths, we prevent uninterpretable information from being smuggled in through the continuous variation in feature activations. However, we also find that binarisation increases the number of uninterpretable ultra-high frequency features, and when interpretability scores are frequency-adjusted, the scores for continuous sparse coders are slightly better than those of binary ones. This suggests that polysemanticity may be an ineliminable property of neural activations.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 19 of its 29 references that are in the map. First posted on arXiv 29 Sep 2025.

Builds on

19 of 29 references.

References · 19

  1. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  3. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  4. 2022Toy Models of Superpositioncited by 928
  5. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  6. 2024Scaling and evaluating sparse autoencoderscited by 530
  7. 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 328
  8. 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
  9. 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
  10. 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
  11. 2024The Road Less Scheduledcited by 158
  12. 2024BatchTopK Sparse Autoencoderscited by 126
7 more
  1. 2024Automatically Interpreting Millions of Features in Large Language Modelscited by 106
  2. 2024Universal Neurons in GPT2 Language Modelscited by 100
  3. 2023Codebook Features: Sparse and Discrete Interpretability for Neural Networkscited by 45
  4. 2024Interpretability as Compression: Reconsidering SAE Explanations of Neural Activations with MDL-SAEscited by 22
  5. 2025Transcoders Beat Sparse Autoencoders for Interpretabilitycited by 22
  6. 2025Sparse Autoencoder Features for Classifications and Transferabilitycited by 19
  7. 2025Revisiting End-To-End Sparse Autoencoder Training: A Short Finetune Is All You Needcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.