Improving Sparse Autoencoder with Dynamic Attention

arXiv:2604.14925v1 Announce Type: new Abstract: Recently, sparse autoencoders (SAEs) have emerged as a promising technique for interpreting activations in foundation models by disentangling features into a sparse set of concepts. However, identifying the optimal level of sparsity for each neuron remains challenging in practice: excessive sparsity can lead to poor reconstruction, whereas insufficient sparsity may harm interpretability. While existing activation functions such as ReLU and TopK provide certain sparsity guarantees, they typically require additional sparsity regularization or cherry-picked hyperparameters. We show in this paper that dynamically sparse attention mechanisms using sparsemax can bridge this trade-off, due to their ability to determine the activation numbers in a data-dependent manner. Specifically, we first explore a new class of SAEs based on the cross-attention architecture with the latent features as queries and the learnable dictionary as the key and value matrices. To encourage sparse pattern learning, we employ a sparsemax-based attention strategy that automatically infers a sparse set of elements according to the complexity of each neuron, resulting in a more flexible and general activation function. Through comprehensive evaluation and visualization, we show that our approach successfully achieves lower reconstruction loss while producing high-quality concepts, particularly in top-n classification tasks.

Related

• Improving Robustness In Sparse Autoencoders via Masked Regularization
• Bi-Lipschitz Autoencoder With Injectivity Guarantee
• The Illusion of Superposition? A Principled Analysis of Latent Thinking in Language Models
• Gating Enables Curvature: A Geometric Expressivity Gap in Attention

Source: arXiv cs.LG | 2026-04-17