Deriving Decoder-Free Sparse Autoencoders from First Principles
Abstract
Gradient descent on log-sum-exp (LSE) objectives performs implicit expectation--maximization (EM): the gradient with respect to each component output equals its responsibility. The same theory predicts collapse without volume control analogous to the log-determinant in Gaussian mixture models. We instantiate the theory in a single-layer encoder with an LSE objective and InfoMax regularization for volume control. Experiments confirm the theory's predictions. The gradient--responsibility identity holds exactly; LSE alone collapses; variance prevents dead components; decorrelation prevents redundancy. The model exhibits EM-like optimization dynamics in which lower loss does not correspond to better features and adaptive optimizers offer no advantage. The resulting decoder-free model learns interpretable mixture components, confirming that implicit EM theory can prescribe architectures.
Cite
@article{arxiv.2601.06478,
title = {Deriving Decoder-Free Sparse Autoencoders from First Principles},
author = {Alan Oursland},
journal= {arXiv preprint arXiv:2601.06478},
year = {2026}
}
Comments
22 pages, 3 figures, 9 tables