Binary Sparse Coding for Interpretability

Lucia Quirke, Stepan Shabalin, Nora Belrose
9/29/2025
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{quirke2025binary,
  title  = {Binary Sparse Coding for Interpretability},
  author = {Lucia Quirke and Stepan Shabalin and Nora Belrose},
  year   = {2025},
  eprint = {2509.25596},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.25596v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.25596.svg)](https://codeofpaper.com/paper/2509.25596)

Discussion