aiqbench analysis
This paper advances sparse autoencoder architectures by introducing block-sparse featurizers tailored for low-dimensional manifolds common in computer vision tasks. The authors address persistent issues like feature splitting through a Tournament Top-K selection rule and extend the framework to crosscoder applications. These architectural refinements offer concrete improvements for interpretability and efficiency in next-generation vision models.
A Deeper Analysis of Block-Sparse Featurizers
arXiv:2608.27515v1 Announce Type: new Abstract: The recently introduced block-sparse featurizer (BSF; Fel et al., 2026) is similar to a sparse autoencoder (SAE), but its atomic unit is a small subspace (a block of directions) rather than a single direction. It is designed for features that live on low-dimensional manifolds, which are especially frequent in vision. This work studies the BSF's strengths and weaknesses, finding how it still somewhat suffers from classic SAE failure modes, like feature splitting and composition. We propose several architectural changes to the BSF, including a Tournament Top-K selection rule that significantly reduces feature splitting, and we also extend the block paradigm to the crosscoder.
Abstract:The recently introduced block-sparse featurizer (BSF; Fel et al., 2026) is similar to a sparse autoencoder (SAE), but its atomic unit is a small subspace (a block of directions) rather than a single direction. It is designed for features that live on low-dimensional manifolds, which are especially frequent in vision. This work studies the BSF's strengths and weaknesses, finding how it still somewhat suffers from classic SAE failure modes, like feature splitting and composition. We propose several architectural changes to the BSF, including a Tournament Top-K selection rule that significantly reduces feature splitting, and we also extend the block paradigm to the crosscoder.
Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)
arXiv:2608.27515 [cs.LG]
(or arXiv:2608.27515v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.27515 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 201 words
Related coverage
Links #5: 2026/07
LessWrong · Jul 31, 2026

Manifolds for Five-Year Olds
LessWrong · Oct 12, 2026

How Does Changing the Elo of a Chess Transformer Affect its Computations?
LessWrong · Sep 29, 2026

How do neural networks regress cubic polynomials? Apparently, they use a trick invented in Milan 500 years ago
LessWrong · Jul 22, 2026