Are Sparse Autoencoder Benchmarks Reliable?
Chanin, DavidarXiv.orgPublished May 18, 2026Original︎ ↗Archived copy
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text37 passages · 2 marked
6 Related work SAE benchmarking failures. Paulo and Belrose [26] find that only ∼30% of features are shared across seed-replicated training runs of the same SAE, raising identifiability concerns. Korznikov et al. [19] report that random-feature baselines match trained SAEs on autointerp, sparse probing, and causal editing; Song et al. [30] propose a feature-consistency metric (PW-MCC) as a complementary reliability axis. Our audit is complementary to these: rather than introducing a single new diagnostic, we evaluate the existing SAEBench suite along three orthogonal lenses (reseed noise, ground-truth correlation, and discriminability across training). Cases where supervised baselines beat SAEs. Kantamneni et al. [16] report that SAE-based sparse probes underperform plain logistic regression across data scarcity, label noise, and covariate shift; Wu et al. [32] find SAE steering inferior to prompting and difference-in-means representations. DeepMind’s recent negative-results report [29] echoes both findings on a safety-relevant probing task. These results suggest the existing proxy metrics overstate SAE quality on downstream tasks, motivating an audit of the proxies themselves. Ground-truth and synthetic SAE evaluation. The toy-model lineage initiated by Elhage et al. [11] establishes sparse linear combinations of orthogonal feature directions as a controlled testbed for dictionary learning. Karvonen et al. [17] run an analogous evaluation on Othello and chess board states, and Makelov et al. [22] construct supervised dictionaries on the IOI task as a com- parison ground truth. O’Neill et al. [25] introduce the optimal-bipartite-matching MCC metric that SynthSAEBench [7] adopts. We use SynthSAEBench-16k as our validity panel. Benchmark auditing in ML more broadly. Liao et al. [20] catalog 107 surveys of evaluation failures, distinguishing internal validity (noise, leakage, baselines) from external validity (transfer of progress to other tasks); Bowman and Dahl [2] propose explicit desiderata for NLU benchmarks, the format we follow. Dehghani et al. [10] show that re-aggregating different subsets of SuperGLUE substantially reorders rankings of competing models. Henderson et al. [14] and Reimers and Gurevych [28] study on seed variance in deep RL and NLP. Card et al. [6] quantifies when test-set sizes are too small for benchmark comparisons to have statistical power. 7 Discussion Practitioners should avoid SCR and TPP TPP and SCR fail multiple basic sanity checks at their canonical settings on trained SAEs. TPP declines through training at top-N ≥ 50 across every SAE we tested, and is poorly correlated with ground truth in our synthetic tests. SCR is negatively correlated with ground-truth at top-N ≥ 50, declines through training at canonical top-N = 10, and swings from ρ = +0.90 to ρ = −0.10 against GT-MCC across reasonable variations of the same base-model architecture (§5.4, Appendix I). We recommend avoiding SCR and TPP benchmarks. SAE metrics struggle with noise and discriminability Many metrics have inter-checkpoint jitter comparable to their inter-variant signal, making them hard to use as a clear target for the field to hill-climb on. The most promising directions for future work are increasing the number and variety of datasets used by each metric, improving the reliability of internal probing steps, and replacing random latent sampling with reproducible selections that transfer across SAE training runs. Limitations of our audit Even for metrics that pass our checks, we cannot say with certainty that a proxy metric is “correct” on LLMs. It is possible for biases or dataset limitations to remain that we cannot measure without ground-truth on real LLMs. Limitations are discussed further in Appendix A. The field needs better SAE benchmarks Without clear and reliable benchmarks, the field will struggle to improve SAEs. Progress on SAE architectures requires stacking small improvements that the current suite cannot reliably detect. We believe SAE benchmarking is solvable, and we hope this audit catalyzes further work to extend and improve the existing suite. 9
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Table 5: Full reseed noise breakdown on the canonical 16k Gemma Scope SAE, five reseeds. Benchmark Mean Std CV sae-probes (k = 1, accuracy) 0.763 0.001 0.1% sae-probes (k = 2, accuracy) 0.782 0.001 0.1% sae-probes (k = 5, accuracy) 0.806 0.001 0.2% sparse_probing (k = 1, accuracy) 0.756 0.004 0.5% sparse_probing (k = 2, accuracy) 0.804 0.003 0.3% sparse_probing (k = 5, accuracy) 0.871 0.004 0.4% RAVEL cause 0.655 0.008 1.2% RAVEL disentangle 0.696 0.003 0.4% RAVEL isolation 0.736 0.011 1.4% autointerp random-latent (nlatents = 1000) 0.820 0.003 0.4% autointerp fixed-latent (nlatents = 1000) 0.829 0.003 0.4% SCR top-2 0.132 0.004 3.0% SCR top-5 0.215 0.008 3.6% SCR top-10 0.287 0.009 3.0% SCR top-20 0.363 0.011 3.1% SCR top-50 0.410 0.022 5.3% SCR top-100 0.347 0.021 6.2% SCR top-500 0.302 0.037 12% TPP top-2 0.009 0.001 14% TPP top-5 0.022 0.009 42% TPP top-10 0.037 0.015 39% TPP top-20 0.069 0.021 31% TPP top-50 0.138 0.025 18% TPP top-100 0.220 0.024 11% TPP top-500 0.400 0.006 1.6% Each diagnostic was run at 3 reseeds per cell with activation caching disabled, matching the reseed- noise protocol of §3. random_l0_matched achieved L0 124.5 via a uniform threshold tuned on a 20k-token Gemma-2-2b L12 calibration set. Reduced evaluation configuration. For compute reasons the diagnostic-SAE evalua- tion that produced Table 8 used a smaller subset of the SAEBench default configura- tion: sparse probing on 3 of the 8 default datasets (LabHC/bias_in_bios_class_set1, canrager/amazon_reviews_mcauley_1and5, fancyzhx/ag_news); SCR on the single LabHC/bias_in_bios_class_set1 dataset (4 of the canonical 8 sub-tasks); and autointerp at N = 200 randomly-sampled latents instead of the canonical N = 1000. All three rows of Table 8 use this same reduced configuration, so the diagnostic comparisons (canonical vs each degraded variant) are internally valid. As a consequence of the reduced configuration, absolute scores in Table 8 differ from those in Appendix C (5 datasets, N = 1000) and Appendix F (canonical configuration); for example, canonical SCR top-10 is 0.208 here versus 0.287 in the canonical-config tables. The qualitative diagnostic conclusions reported below depend on relative comparisons within the table and are unaffected by the configuration choice. Pass/fail summary. permuted_decoder fails sparse_probing, sae-probes, and autointerp (each within reseed noise of canonical, indicating these benchmarks are encoder-only by construction); passes TPP, SCR, and RAVEL (each crashes well outside reseed noise). random_l0_matched passes all six benchmarks (each crashes well below canonical), but the no-information floor is non- trivially high on sparse_probing (0.744) and sae-probes (0.745), so a casual benchmark consumer might mistake an L0-matched random projection for a weak but meaningful SAE. Implementation notes. SAEBench’s RAVEL hooks assume Gemma2DecoderLayer.forward re- turns a (hidden_states,) tuple; in transformers 5.6.2 it returns hidden_states directly, breaking the hook code with IndexError: too many indices for tensor of dimension 2. Our runner monkey-patches the hook boundary; without this, all RAVEL runs fail. Worth flagging as a SAEBench compatibility bug. The random_l0_matched diagnostic uses a uniform threshold across all 16,384 latents (single value), whereas canonical Gemma-Scope JumpReLU uses a learned per- 16
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Lineage across 7 claims
Record
- Kind
- preprint
- Authors
- Chanin, David
- Publisher
- arXiv.org
- Published
- May 18, 2026
- DOI
- None
- Link
- https://arxiv.org/pdf/2605.18229
- Archived copy
- https://web.archive.org/web/20261001123132/https://arxiv.org/pdf/2605.18229
- Stored text
- 114,425 characters, retrieved Nov 13, 2026 · 2 sections, 37 passages
- Claims extracted
- For
sparse autoencoders compared with simpler baselines on labeled tasks: setups, baseline tuning, results
· 7 claims (6 new) · Nov 13, 2026 for Reconciling conflicting published results on contested AI safety research questions
- For
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 13, 2026
History 3
- Nov 13, 2026DividedSegmenter · Divided into 38 parts by its own structure
- Nov 13, 2026FactsFacts fetcher · Facts looked up
- Nov 13, 2026Entered the graphEntered the graph; copy stored