Minerval
Sourceconference papertext stored

Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?

Korznikov, Anton, Galichin, Andrey, Dontsov, Alexey, Rogov, Oleg, Oseledets, Ivan, Tutubalina, ElenaarXiv.orgPublished Feb 15, 2026Original︎ ↗Archived copy

Claims9
ExaminationsNone
Text1 section
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 13, 2026
ReachNo copies recorded
StructureIn 9 claims' maps0 sources downstream across 9 claims
EvidenceNot yet read
ReviewsNot reviewed

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.

Text33 passages · 6 marked

No examination yetMarked passage
Opening

Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines? Anton Korznikov∗ AXXX HSE University Andrey Galichin∗ AXXX Applied AI Institute Alexey Dontsov AXXX HSE University Oleg Rogov AXXX MTUCI Safe AI Lab Applied AI Institute Ivan Oseledets AXXX Elena Tutubalina AXXX HSE University Abstract Sparse Autoencoders (SAEs) have emerged as a promising tool for interpret- ing neural networks by decomposing their activations into sparse sets of human- interpretable features. Despite much excitement, a growing number of negative results in downstream tasks casts doubt on whether SAEs recover meaningful features. To directly investigate this, we perform two complementary evaluations. On a synthetic setup with known ground-truth features, we demonstrate that three out of four state-of-the-art SAE architectures recover only 7–9% of true features de- spite achieving around 71% explained variance, showing that strong reconstruction alone is insufficient to guarantee meaningful feature recovery. To evaluate SAEs on real activations, we introduce three baselines that constrain SAE feature directions or their activation patterns to random values. Through extensive experiments across multiple SAE architectures, we show that our baselines match fully-trained SAEs in interpretability (0.87 vs 0.90), sparse probing (0.69 vs 0.72), and causal editing (0.73 vs 0.72). These results show that current evaluation metrics are insufficient to certify that SAEs have learned meaningful features, and we offer our baselines as a reusable protocol for future SAE evaluation. 1 Introduction Large Language Models (LLMs) have achieved remarkable performance across a wide range of natu- ral language processing tasks, with applications continuing to expand rapidly. As these models grow in capability and deployment, the interpretation of their internal mechanisms becomes increasingly important [Bereska and Gavves, 2024, Grace et al., 2025]. Interpretability could potentially help to understand specific learning behaviors, such as safety mechanisms [Arditi et al., 2024] and reasoning processes [Wang et al., 2023, Galichin et al., 2025], identify misalignment risks [Betley et al., 2025, Wang et al., 2025]. Sparse Autoencoders (SAEs) serve as a popular tool for this purpose, aiming to decompose dense model activations into sparse human-interpretable features [Bricken et al., 2023, Huben et al., 2024]. Recent contributions have introduced various SAE architectures [Rajamanoharan et al., 2024b, Bussmann et al., 2024, Korznikov et al., 2025, Bussmann et al., 2025], with further success in scaling to frontier models [Gao et al., 2025, Lieberum et al., 2024]. However, a critical challenge remains: lacking ground truth for true features, it is difficult to determine whether SAEs recover meaningful representations. Recent negative results on downstream applications [Smith et al., 2025, Wu et al., 2025] further underscore this challenge. ∗Equal contribution. Correspondence: korznikovantona@gmail.com 40th Conference on Neural Information Processing Systems (NeurIPS 2026). Track on Evaluations and Datasets.arXiv:2602.14111v2 [cs.LG] 2 Nov 2026

Opening

Figure 5: Frozen SAE baselines on sparse probing (Left) and causal editing (Right). Frozen BatchTopK and JumpReLU variants reach single-top-latent probing accuracy comparable to fully- trained SAEs. RAVEL disentanglement scores with frozen components are equivalent to fully-trained SAEs. disentangled manner. Following Karvonen et al. [2025], we evaluate across five diverse concept types: profession classification, product classification and sentiment analysis, language identification, programming language classification, and news topic categorization. As shown in Figure 5, left, sparse probing accuracy remains strong even when core SAE components are randomly initialized and frozen. Under the single-top-latent (k=1) setup, frozen variants of both BatchTopK and JumpReLU SAEs achieve accuracy scores comparable to their fully-trained counterparts across all sparsity levels (for k=5 see Appendix C). For instance, at L0=225, the BatchTopK Frozen Decoder variant reaches 0.70, matching the fully-trained model’s score, while the Frozen Encoder variant attains 0.65, a difference of only 0.05. These gaps remain narrow (0.001 to 0.07) across all settings and stay well above the random-guessing baseline of 0.50. Together, these findings indicate that sparse probing scores can be inflated by dictionary scale alone: with tens of thousands of latents, some will inevitably correlate with concept clusters by chance, limiting its value as a standalone indicator of meaningful feature learning. We further discuss whether SAEs may learn features collectively rather than individually in Appendix F. Frozen SAEs retain strong RAVEL causal editing performance. To further test if SAEs discover genuinely meaningful model features, we examine their causal properties. We evaluate whether SAE latents encode causally independent concepts using the RAVEL framework [Huang et al., 2024, Karvonen et al., 2025], which tests if targeted interventions on latents can cleanly edit model predictions. This framework assesses whether the apparent causal utility of SAEs depends on learned feature alignment or can be achieved with frozen random components. Given a factual statement like “Paris is in France”, we encode the subject token (e.g., “Paris”) with the SAE, train a binary mask to transfer latent values from a different token (e.g., “Tokyo”), and decode the modified latents back into the residual stream. The model then generates completions; a successful edit would change the targeted attribute (e.g., now stating “Paris is in Japan”) while preserving other attributes (e.g., still “People in Paris speak French”). The RAVEL disentanglement score averages cause (target attribute change) and isolation (other attributes unchanged). As shown in Figure 5, right, both BatchTopK and JumpReLU SAE variants with frozen components achieve RAVEL scores competitive with their fully-trained counterparts. For BatchTopK, the fully trained model achieves a RAVEL score of approximately 0.72–0.74 across higher sparsity levels (L0 ≥ 160). The Frozen Decoder variant performs surprisingly well, reaching 0.57-0.62, demonstrating that effective causal editing can be achieved even when decoder vectors are frozen as random directions. The Frozen Encoder variant also shows strong performance, maintaining a score of 0.63 for L0 = 160. Meanwhile, the Soft-Frozen Decoder variant matches or even exceeds the fully trained model, reaching up to 0.78 at L0 = 320. Thus, causal editing performance alone cannot distinguish learned representations from random vector coverage, revealing a gap in the discriminative power of current evaluation metrics. 9

Opening

5 Limitations Our synthetic setup assumes independent feature activations, omitting correlations present in real networks. Since three out of four architectures fail even in this simplified sanity check, a more realistic setting would only increase the difficulty. How to incorporate structured covariances without arbitrary assumptions remains an open question. Structured-correlation synthetic results on Synth- SAEBench [Chanin and Garriga-Alonso, 2026] are reported in Appendix I. We focus on standard SAE architectures and do not evaluate related approaches such as transcoders or crosscoders [Dunefsky et al., 2024]; the same frozen-encoder/decoder protocol can be applied to them, but we have not run those experiments and do not claim numerical gaps transfer. 6 Discussion and Conclusion We evaluated SAEs through two complementary approaches: synthetic experiments with known ground-truth features, and comparisons against random baselines on real LLM activations. In synthetic settings with fully aligned hyperparameters, three out of four SAE architectures achieve 71% explained variance yet recover only 7–9% of true features - a failure mode invisible to reconstruction metrics alone. On real LLM activations, our frozen baselines match fully-trained SAEs across reconstruction, interpretability, sparse probing, and causal editing, showing that passing standard benchmarks is not sufficient evidence of meaningful feature decomposition. The disconnect between reconstruction and feature recovery is expected from classical sparse dictio- nary learning (NP-hard / non-identifiable under weak conditions) [Tillmann, 2014, Razaviyayn et al., 2015, Spielman et al., 2012]; our synthetic results empirically confirm that good reconstruction need not recover ground-truth features. When decoder directions remain near-random, we hypothesize that the encoder mainly performs amortized sparse selection over an expressive random dictionary; we do not claim a confirmed mechanism. Our baselines are simple to implement and serve as minimal sanity checks: if a new SAE architecture substantially outperforms them, that provides stronger evidence for genuine feature learning (Appendix J). We emphasize that our findings are a critique of current evaluation methodology, not a verdict against SAEs as a paradigm - and we hope they motivate more rigorous evaluation standards in mechanistic interpretability. Acknowledgments and Disclosure of Funding The authors received no specific funding for this work beyond their institutional affiliations. Competing interests The authors declare no competing interests. References A. Arditi, O. Obeso, A. Syed, D. Paleka, N. Panickssery, W. Gurnee, and N. Nanda. Refusal in language models is mediated by a single direction. In A. Globerson, L. Mackey, D. Bel- grave, A. Fan, U. Paquet, J. Tomczak, and C. Zhang, editors, Advances in Neural Information Processing Systems, volume 37, pages 136037–136083. Curran Associates, Inc., 2024. doi: 10.52202/079017-4322. URL https://proceedings.neurips.cc/paper_files/paper/ 2024/file/f545448535dfde4f9786555403ab7c49-Paper-Conference.pdf. L. Bereska and S. Gavves. Mechanistic interpretability for AI safety - A review. Trans. Mach. Learn. Res., 2024, 2024. URL https://openreview.net/forum?id=ePUVetPKu6. J. Betley, D. C. H. Tan, N. Warncke, A. Sztyber-Betley, X. Bao, M. Soto, N. Labenz, and O. Evans. Emergent misalignment: Narrow finetuning can produce broadly misaligned LLMs. In A. Singh, M. Fazel, D. Hsu, S. Lacoste-Julien, F. Berkenkamp, T. Maharaj, K. Wagstaff, and J. Zhu, editors, Proceedings of the 42nd International Conference on Machine Learning, volume 267 of Proceedings of Machine Learning Research, pages 4043–4068. PMLR, 13–19 Jul 2025. URL https://proceedings.mlr.press/v267/betley25a.html. 10

Opening

Figure 6: Frozen baseline performance for TopK SAE (L0=160) on Gemma-2-2B layer 12. A SAEs: Claimed Benefits vs. Documented Limitations Table 1 provides a comprehensive overview of both the claimed advantages that have motivated widespread adoption of SAEs and the documented challenges that cast doubt on their reliability. Table 1: Sparse Autoencoders: Claimed Benefits vs. Documented Limitations Claimed Benefits Documented Limitations Core Purpose: Decompose dense activations into sparse, interpretable, monosemantic features [Bricken et al., 2023, Huben et al., 2024] Spurious Features: Find features even in randomly initialized transformers with no learned structure [Heap et al., 2025] Monosemanticity: Address polysemanticity by learning features that correspond to single coherent concepts [Bricken et al., 2023, Huben et al., 2024] Unfaithfulness: Reconstructed features do not faithfully represent true model computations [Leask et al., 2025, Menon et al., 2025] Scalability: Successfully scaled to frontier models including Claude 3 Sonnet, GPT-4, and Gemma 2 [Templeton et al., 2024, Gao et al., 2025, Lieberum et al., 2024] Poor Generalization: Fail to generalize across tasks, settings, and perturbations [Heindrich et al., 2025, Kantamneni et al., 2025, Li et al., 2026] AI Safety Applications: Enable mechanistic in- terpretability for understanding safety mechanisms, reasoning, and misalignment [Wang et al., 2023, Galichin et al., 2025] Downstream Performance: Underperform on downstream tasks; other approaches often outper- form SAEs [Wu et al., 2025, Smith et al., 2025] Reconstruction Quality: Achieve high reconstruc- tion fidelity [Bricken et al., 2023, Gao et al., 2025] Training Fragility: Highly sensitive to hyperpa- rameters and initialization [Chanin and Garriga- Alonso, 2025, Paulo and Belrose, 2025, Minegishi et al., 2025] B Frozen Baselines for TopK SAE on Real Activations To provide a comprehensive evaluation across SAE architectures, we extend our frozen baseline analysis to the simpler TopK SAE variant. Figure 6 presents the performance of TopK SAE (L0=160) trained on Gemma-2-2B layer 12 activations, comparing the four variants (Fully Trained, Soft-Frozen Decoder, Frozen Decoder, Frozen Encoder) across our standard evaluation metrics. Notably, despite TopK SAE’s strong performance in the synthetic setting (Section 3), this advantage does not transfer to real LLM activations: frozen variants of TopK SAE remain competitive with the fully trained model, mirroring the pattern observed for BatchTopK and JumpReLU. This suggests that TopK’s superior feature recovery in controlled synthetic settings is an artifact of that simplified setup rather than a general property of the architecture. 15

Opening

≈ 6.36 × 10−321, (9) P (Y ∈ X) ≤ 4.67 × 10−316. (10) Thus, the Soft-Frozen Decoder is mathematically unlikely to align with arbitrary semantic features beyond chance initialization. Its strong performance must therefore arise from efficiently combining its nearly-fixed, random directions through vanishingly small adjustments to both encoder and decoder vectors. This provides formal evidence that standard SAE metrics can be optimized without learning meaningful feature directions, challenging the assumption that reconstruction fidelity indicates successful feature discovery. Discussion The competitive performance of Soft-Frozen Decoder SAEs across multiple evaluation dimensions (Figure 1) provides strong support for the lazy training hypothesis: much of what we attribute to learned feature discovery may instead reflect efficient use of nearly-fixed, randomly initialized components with only minimal adjustments. This success challenges the premise that SAEs learn meaningful feature decompositions through training, and underscores the importance of rigorous validation against constrained baselines in interpretability research. D Frozen Models Ablation We provide an ablation study comparing fully-trained SAEs against our frozen baselines under two initialization schemes: iso (vectors sampled uniformly from the unit sphere) and cov (vectors sampled from a Gaussian distribution with zero mean and covariance estimated from real activations, then normalized). Tables 3, 4, and 5 report key metrics (mean ± standard deviation over 3 seeds) at L0=160 for Gemma-2-2B layers 12 and 19, and Llama-3-8B layer 16. The experiments in the preceding sections use the best-performing initialization for each baseline: cov for Frozen Decoder and iso for Soft-Frozen Decoder and Frozen Encoder. These results confirm that the competitive performance of frozen baselines is consistent across layers and model families. One-sided Welch t-tests (H0: μ(fully-trained) ≤ μ(frozen); n=3 seeds) across frozen variants in these tables reach significance for Explained Variance in 30/30 comparisons, Sparse Probing (top-1) in 21/30, and Causal Editing in 20/30; for roughly a quarter of downstream comparisons the gap is not statistically significant. Stars in the tables mark p<0.05/0.01/0.001 (∗/∗∗/∗∗∗). E Additional Metrics To complement our primary evaluation metrics, we assess SAEs and frozen baselines using additional performance measures following the SAEBench framework [Karvonen et al., 2025], which evaluates cross-entropy loss and KL-divergence when substituting original activations with SAE reconstructions. As shown in Figures 8 and 9, Frozen Decoder and Frozen Encoder baselines show modest degradation in these metrics compared to fully-trained SAEs. In contrast, the Soft-Frozen Decoder variant closely matches, and sometimes exceeds, the performance of fully-trained ReLU SAEs, demonstrating that even minimal adjustments to decoder vectors can achieve strong reconstruction quality. When moving from single-latent to multi-latent sparse probing (top-5, Figure 10), frozen baselines show only modest gaps relative to fully-trained SAEs (3–8%, as detailed in Appendix F), indicating that even collective feature structure does not strongly favor learned representations over random baselines. F Atomic vs. Aggregate Feature Learning A natural objection to our findings is that SAEs may not be intended to learn features in the strict atomic sense, where each individual decoder vector corresponds to a single, human-interpretable concept, but rather collectively, where groups of decoder vectors together span a meaningful semantic subspace. Under this weaker hypothesis, the relevant question is not whether individual latents are meaningful, but whether the learned dictionary as a whole provides a useful structured decomposition of activation space. 17

Opening
Table 2
Table 2: Evaluation metrics for Soft-Frozen Decoder across constraint values τ .
Method Explained Variance ↑ Sparse Probing (Top-1) ↑ Causal Editing ↑
Fully-Trained SAE 0.852 0.721 0.720
Soft-Frozen (τ = 0.80) 0.785 0.659 0.728
Soft-Frozen (τ = 0.90) 0.734 0.639 0.712
Soft-Frozen (τ = 0.95) 0.691 0.637 0.681
We note, however, that the atomic interpretation is precisely what motivates the primary use cases of
SAEs in mechanistic interpretability: individual latents are labeled, steered, and causally intervened
upon in isolation [Bricken et al., 2023, Templeton et al., 2024]. A decomposition where no individual
decoder vector corresponds to a semantic concept, but groups of them collectively encode useful
structure, would undermine these applications, as any apparent interpretability of individual latents
would be an artifact of evaluation rather than evidence of genuine feature discovery.
That said, our experiments provide evidence against even this weaker collective hypothesis. The
top-5 sparse probing task, in which a logistic probe is trained on the five most concept-predictive
latents, offers a partial test: it measures whether the learned dictionary contains at least a small cluster
of latents that collectively encode a target concept. As shown in Tables 3–5, fully-trained SAEs do
not substantially outperform frozen baselines even in this setting. The gaps between fully-trained
SAEs and their best-performing frozen counterparts range from 3.0% (BatchTopK on Llama-3-8B
layer 16) to 7.9% (BatchTopK on Gemma-2-2B layer 19), with frozen encoders, whose activation
patterns are entirely random, remaining competitive across all settings. Thus, even when evaluated
on collective rather than individual feature structure, frozen baselines offer only marginally weaker
evidence of meaningful decomposition than fully-trained SAEs.
G Ablation on the Soft-Frozen Decoder Threshold
The Soft-Frozen Decoder constrains decoder vectors to maintain cosine similarity τ ≥ 0.8 with
their random initialization throughout training. While τ = 0.8 is our primary setting (motivated in
Appendix C), one might ask whether downstream metrics would degrade under stricter constraints.
To address this, we ran an ablation with τ ∈ {0.8, 0.9, 0.95} for BatchTopK SAE (L0=160) on layer
12 of Gemma-2-2B.
As shown in Table 2, tightening the constraint produces the expected degradation in Explained
Variance, which drops from 0.785 to 0.691 as τ increases from 0.8 to 0.95 - a natural consequence
of leaving less room for directional adjustment. However, the downstream task metrics tell a
strikingly different story: Sparse Probing and Causal Editing scores remain largely stable across
all constraint levels despite the reconstruction penalty. This asymmetry reinforces our main thesis:
while reconstruction fidelity is sensitive to how tightly the decoder is constrained, the interpretability-
oriented metrics that are typically used to validate SAEs are surprisingly robust to this constraint, and
therefore insufficient to certify meaningful feature learning.
H Random SAEs on CLIP
To validate our findings from language models, we conduct a parallel analysis on vision models by
comparing trained and randomly initialized SAEs on CLIP ViT-B/32 [Radford et al., 2021]. We use
pretrained SAEs [Joseph et al., 2025] from layers 3, 5, 7, and 9 and create matched random baselines
with identical architectures but Kaiming-initialized weights. For each SAE, we select features with
rare (< 0.1%) activation frequency, then visualize images from ImageNet-10k [Deng et al., 2009]
at different activation percentiles (100th, 75th, 50th, 25th) for each feature. This percentile-based
visualization reveals whether features capture coherent semantic concepts. Some trained features
(layers 3 and 9) show clearer monosemantic concepts, while many at layers 5 and 7 remain ambiguous,
so the distinction from random baselines is not always sharp. We present these visualisations in
Figures 11, 12, 13 and 14
18

Lineage across 9 claims

Draws on · none recorded
This source
Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?
in 9 claims' maps
Drawn on by · none recorded

Record

Kind
conference paper
Authors
Korznikov, Anton, Galichin, Andrey, Dontsov, Alexey, Rogov, Oleg, Oseledets, Ivan, Tutubalina, Elena
Publisher
arXiv.org
Published
Feb 15, 2026
DOI
None
Link
https://arxiv.org/pdf/2602.14111
Archived copy
https://web.archive.org/web/20261105151425/https://arxiv.org/pdf/2602.14111
Stored text
93,699 characters, retrieved Nov 13, 2026 · 1 sections, 33 passages
Claims extracted
Versions
One known
Copies
None recorded
Corrections
None recorded
Facts checked
Nov 13, 2026

History 3

  1. Nov 13, 2026DividedSegmenter · Divided into 33 parts by its own structure
  2. Nov 13, 2026FactsFacts fetcher · Facts looked up
  3. Nov 13, 2026Entered the graphEntered the graph; copy stored