Papers › Codebook Features: Sparse and Discrete Interpretability for Neural Networks

Codebook Features: Sparse and Discrete Interpretability for Neural Networks

26 Oct 2023arXiv:2310.17230archive 2025-07-28

Alex Tamkin, Mohammad Taufeeque, Noah D. Goodman

Understanding neural networks is challenging in part because of the dense, continuous nature of their hidden states. We explore whether we can train neural networks to have hidden states that are sparse, discrete, and more interpretable by quantizing their continuous features into what we call codebook features. Codebook features are produced by finetuning neural networks with vector quantization bottlenecks at each layer, producing a network whose hidden features are the sum of a small number of discrete vector codes chosen from a larger codebook. Surprisingly, we find that neural networks can operate under this extreme bottleneck with only modest degradation in performance. This sparse, discrete bottleneck also provides an intuitive way of controlling neural network behavior: first, find codes that activate when the desired behavior is present, then activate those same codes during generation to elicit that behavior. We validate our approach by training codebook Transformers on several different datasets. First, we explore a finite state machine dataset with far more hidden states than neurons. In this setting, our approach overcomes the superposition problem by assigning states to distinct codes, and we find that we can make the neural network behave as if it is in a different state by activating the code for that state. Second, we train Transformer language models with up to 410M parameters on two natural language datasets. We identify codes in these models representing diverse, disentangled concepts (ranging from negative emotions to months of the year) and find that we can guide the model to generate different topics by activating the appropriate codes during inference. Overall, codebook features appear to be a promising unit of analysis and control for neural networks and interpretability. Our codebase and models are open-sourced at https://github.com/taufeeque9/codebook-features.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.17230")

Code

Syntology Ran 9 of 11 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · honoured contract; 8 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

taufeeque9/codebook-features officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 9 ran; 1 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
8ran
2unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from taufeeque9/codebook-features. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

color_str taufeeque9/codebook-features/codebook_features/utils.py official repository ran MIT (permissive) · 315c612a7005019a · report
create_tokenizer taufeeque9/codebook-features/codebook_features/train_fsm_model.py official repository ran MIT (permissive) · e7a3a433b5807b51 · report
features_to_tokens taufeeque9/codebook-features/codebook_features/utils.py official repository ran MIT (permissive) · e883b9a34464b3db · report
get_next_state_probs taufeeque9/codebook-features/codebook_features/fsm_utils.py official repository ran MIT (permissive) · bc3765261beb68f8 · report
get_optimizer taufeeque9/codebook-features/codebook_features/train_codebook.py official repository ran MIT (permissive) · ca5c4697a5c093ec · report
load_code_search_cache taufeeque9/codebook-features/codebook_features/code_search_utils.py official repository ran MIT (permissive) · 0baf689e42d326b6 · report
prepare_logging taufeeque9/codebook-features/codebook_features/train_codebook.py official repository ran MIT (permissive) · dbc3ad84e8a2ddd9 · report
preprocess_logits_for_metrics taufeeque9/codebook-features/codebook_features/run_clm.py official repository ran · honoured contract MIT (permissive) · d2895bdf14e8f94f · report
search_re taufeeque9/codebook-features/codebook_features/code_search_utils.py official repository ran MIT (permissive) · 605b9653cd77b330 · report
load_dataset_cache taufeeque9/codebook-features/codebook_features/code_search_utils.py official repository unverified MIT (permissive) · 4471d92715bb6e40 · report
logits_to_pred taufeeque9/codebook-features/codebook_features/utils.py official repository unverified MIT (permissive) · 1c6d09ac6435d64a · report

Tasks

Quantization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections