mlsanityData to 7 Oct 2026

SCALAR: Benchmarking SAE Interaction Sparsity in Toy LLMs

arXiv 2511.07572 ↗First posted 10 Nov 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Mechanistic interpretability aims to decompose neural networks into interpretable features and map their connecting circuits. The standard approach trains sparse autoencoders (SAEs) on each layer's activations. However, SAEs trained in isolation don't encourage sparse cross-layer connections, inflating extracted circuits where upstream features needlessly affect multiple downstream features. Current evaluations focus on individual SAE performance, leaving interaction sparsity unexamined. We introduce SCALAR (Sparse Connectivity Assessment of Latent Activation Relationships), a benchmark measuring interaction sparsity between SAE features. We also propose "Staircase SAEs", using weight-sharing to limit upstream feature duplication across downstream features. Using SCALAR, we compare TopK SAEs, Jacobian SAEs (JSAEs), and Staircase SAEs. Staircase SAEs improve relative sparsity over TopK SAEs by 59.67% ± 1.83% (feedforward) and 63.15% ± 1.35% (transformer blocks). JSAEs provide 8.54% ± 0.38% improvement over TopK for feedforward layers but cannot train effectively across transformer blocks, unlike Staircase and TopK SAEs which work anywhere in the residual stream. We validate on a 216K-parameter toy model and GPT-2 Small (124M), where Staircase SAEs maintain interaction sparsity improvements while preserving feature interpretability. Our work highlights the importance of interaction sparsity in SAEs through benchmarking and comparing promising architectures.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 23 references that are in the map. First posted on arXiv 10 Nov 2025.

Builds on

14 of 23 references.

References · 14

  1. 2016Layer Normalizationcited by 5,579
  2. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  3. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
  4. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
  5. 2024Scaling and evaluating sparse autoencoderscited by 530
  6. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
  7. 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
  8. 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 148
  9. 2025Are Sparse Autoencoders Useful? A Case Study in Sparse Probingcited by 109
  10. 2021Transformer visualization via dictionary learning: contextualized embedding as a linear superposition of transformer factorscited by 106
  11. 2025Transformers without Normalizationcited by 69
  12. 2024Evolution of SAE Features Across Layers in LLMscited by 14
2 more
  1. 2024You can remove GPT2's LayerNorm by fine-tuningcited by 11
  2. 2025Jacobian Sparse Autoencoders: Sparsify Computations, Not Just Activationscited by 9

Built on by

Not cited yet.