Readout Scaling Shapes Sparse Feature Recovery
cs.LG, cs.AI, cs.CL
Submitted: 2026-10-13
Updated: 2026-10-14
License: http://creativecommons.org/licenses/by/4.0/
The gist: Readout scaling changes what a sparse autoencoder (SAE) learns, but the benefit of removing it depends on the data.
Abstract
Readout scaling changes what a sparse autoencoder (SAE) learns, but the benefit of removing it depends on the data. We use readout-canonicalized decision-space (RC-DS) coordinates to remove singular-value gains while preserving retained decision information. At a fixed readout condition number, changing the generating distribution reverses which training coordinates recover known factors best. In our controlled coordinate-matching study, recovery is highest when training restores the space in which the factors were generated. When factors are generated before readout scaling, RC-DS increases mean sparse-factor recovery from 0.506 to 0.913 at condition number 100, compared with centered-logit training under the same budget. An exact wrapper reproduces RC-DS training to numerical precision, isolating training geometry rather than additional information. In neural policies, RC-DS improves mean logit reconstruction under the tested budgets. On three fixed language-model checkpoints, RC-DS has higher mean gain-free reconstruction in all 18 tested task-sparsity settings, while centered-logit SAEs reconstruct output logits better in 17. Small-label-head controls show that longer training reduces the reconstruction gap from 0.0198 to 0.0016. Together, these results show how readout scaling, the data distribution, and training shape sparse learning. RC-DS provides an information-preserving method for studying and controlling the readout's contribution. Separate label-detection and steering tests distinguish these reconstruction effects from task-specific feature usefulness.
Sources
- Eliciting Latent Predictions from Transformers with the Tuned Lens
- SmolLM2: When Smol Goes Big -- Data-Centric Training of a Small Language Model
- Sparse Autoencoders Find Highly Interpretable Features in Language Models
- Plug and Play Language Models: A Simple Approach to Controlled Text Generation
- Pre-Intervention Prediction of Sparse Autoencoder Steering Side Effects
- Scaling and evaluating sparse autoencoders
- Adam: A Method for Stochastic Optimization
- Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?
- OpenSpiel: A Framework for Reinforcement Learning in Games
- Compute Optimal Inference and Provable Amortisation Gap in Sparse Autoencoders
- Qwen3 Technical Report
- Improving Dictionary Learning with Gated Sparse Autoencoders
- Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoders
- DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
- Data Whitening Improves Sparse Autoencoder Learning
- The Geometric Wall: Manifold Structure Predicts Layerwise Sparse Autoencoder Scaling Laws
- Understanding Adam Requires Better Rotation Dependent Assumptions
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks