A Testable Theory of Atomic Features
cs.AI, cs.LG
Submitted: 2026-10-05
Updated: 2026-10-05
Code: https://github.com/kennylpeng/atomic_theory
License: http://creativecommons.org/licenses/by/4.0/
The gist: We develop and test a theory of language model representations in which there exist atomic features.
Abstract
We develop and test a theory of language model representations in which there exist atomic features. Our main theoretical insight is that in such a model, sparse dictionaries (e.g., SAEs) of increasing size recover an increasing prefix of the most prevalent atoms in the training data. This "recovery principle" yields three testable predictions: many features in small SAEs are shared by all larger SAEs, SAEs trained on different data share features prevalent in both, and sufficiently large SAEs recover both parent and child features. In contrast to conventional wisdom that SAE features are unstable and "split" as size increases, we find that these predictions hold on SAEs of sizes ranging from 512 to 131,072 trained on two large embedding models. From a theoretical perspective, our results suggest the promise of a scientific theory of representations based on atomic features. Practically, our results suggest the promise of scaling SAEs.
Sources
- Emergent Linear Representations in World Models of Self-Supervised Sequence Models
- (How) Do Language Models Track State?
- Steering Llama 2 via Contrastive Activation Addition
- Representation Engineering: A Top-Down Approach to AI Transparency
- Steering Language Models With Activation Engineering
- Persona Features Control Emergent Misalignment
- Persona Vectors: Monitoring and Controlling Character Traits in Language Models
- Toy Models of Superposition
- The Linear Representation Hypothesis and the Geometry of Large Language Models
- From Flat to Hierarchical: Extracting Sparse Representations with Matching Pursuit
- Sparse Autoencoders Find Highly Interpretable Features in Language Models
- Scaling and evaluating sparse autoencoders
- Sparse Autoencoders for Hypothesis Generation
- Position: Use Sparse Autoencoders to Discover Unknowns
- Sparse Autoencoders Trained on the Same Data Learn Different Features
- Archetypal SAE: Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision Models
- Learning Multi-Level Features with Matryoshka Sparse Autoencoders
- Sparse but Wrong: Incorrect L0 Leads to Incorrect Features in Sparse Autoencoders
- k-Sparse Autoencoders
- An Incidence Geometry approach to Dictionary Learning
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems