Skip to content

Readout Scaling Shapes Sparse Feature Recovery

Oct 2026 · 0 citations
Computer Science

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.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Representation Redistribution in Sparse Autoencoders

Sparse autoencoders (SAEs) decompose language model activations into sparse features, but prompt transformations designed to preserve the underlying request can redistribute activity across them. A feature change observed on one transformed prompt need not recur, and even a recurring change need not affect a downstream...

Zi-Ye Mei, Hao-Tian Ma · 0 citations
#machine learning Preprint Oct 2026

Diminishing Returns of Data in Sparse Autoencoders: Functional Behavior does not Guarantee Feature Reproducibility

This work studies how much activation data SAEs need by training four SAE architectures on three language models with budgets ranging from 5M tokens to a 500M-token reference, and measures two notions of convergence: functional behavior on standard evaluations and one-to-one reproducibility of learned features.

Sambit Ghosh, Madelyn Mathai, R. Babu et al. · 0 citations
#machine learning Preprint Sep 2026

Frozen Cores Need Task Signal: Fisher-Whitened Cross-Covariance for Low-Resource LLM Adaptation

FCCA, which estimates the signed input--error cross-covariance, whitens it with diagonal Fisher moments, truncates it in the resulting local metric, maps the selected directions back, and applies thin QR to obtain stable core coordinates, shows that a carefully selected fixed span can recover most of the benefit of mov...

Wen-Song Ye, Zhan-Ming Shen, Zhiqing Xiao et al. · 1 citation · ⚡1
#artificial intelligence Preprint Oct 2026

SARATHI: Decoupled Data-Free Probing and Adaptive Reconstruction for Structured LLM Pruning

Structured pruning reduces the inference cost of large language models (LLMs) by permanently removing neurons and weight rows, yielding dense, hardware-agnostic speedup. Existing post-training methods couple neuron selection and weight reconstruction through a shared calibration dataset, introducing domain bias and out...

Sankar Behera, Dhruv Singh, Satyadev Ahlawat et al. · 0 citations
#machine learning Preprint Sep 2026

Scaling Zero-Order Pretraining through Model Sharding

Zero-order optimization (ZO) trains without backpropagation, making it relevant to forward-only hardware and non-differentiable loss, but its gradient variance grows with perturbed dimension, inhibiting large-model training. Sharded Optimization Mixture of Assemblies (SOMA) trains LSTM experts independently on $N$ data...

Francois Chaubard, M. Kochenderfer, Chris Ré · 0 citations
#machine learning Preprint Sep 2026

Common-Mode Collapse and Recovery in Direct Feedback Alignment

A exact mean-covariance decomposition separates a rank-one update formed by the mean teaching signal and mean presynaptic activity, which prevents sustained collapse and improves learning in the tested setting.

V. Reddy, Bernardo L. Sabatini, Houman Safaai · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.