mlsanityData to 14 Oct 2026

Feature Lottery? A Bifurcation Theory of Concept Emergence

arXiv 2605.24057 ↗First posted 22 May 2026cs.LG cs.AIcited by 0

On the map: Mechanistic interpretability → Circuits and mechanistic analysis

Abstract (arXiv)

Neural networks acquire structured representations at specific moments during training, yet identifying these transitions typically relies on retrospective, label-dependent metrics. We introduce a bifurcation theory of representation dynamics to detect these moments in real time. Analyzing a passive GMM probe attached to the evolving encoder, we show the onset of structure corresponds to a supercritical pitchfork bifurcation driven by the loss Hessian. The system exhibits a theoretically predictable zero-crossing (βc) that, compared to the network's current state (β), yields a dynamic ratio β(t)/βc(t): a universal, label-free phase coordinate for representation dynamics, computable entirely from hidden states. We empirically validate four distinct transition regimes predicted by this coordinate across diverse settings: SAEs on language models (Pythia), SSL (CIFAR), and grokking (modular arithmetic). Crucially, under finite dissipation, macroscopic symmetry-breaking can lag the initial zero-crossing by orders of magnitude, which providing a rigorous dynamical account of the delayed escape observed in grokking. Microscopically, the bifurcation creates a shared unstable subspace, forcing collective symmetry breaking. We term this the "feature lottery" in SAE training: a feature's terminal interpretability becomes predictable remarkably early. By only 5% of training, early atom purity robustly predicts final convergence purity, with top-decile early atoms achieving over 12x the baseline purity at convergence. Beyond explaining concept emergence, β/βc provides a practical early-warning indicator for training health, detecting the onset of usable structure, the crystallization of feature identity, and representational collapse epochs before downstream metrics react.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 15 of its 23 references that are in the map. First posted on arXiv 22 May 2026.

Builds on

15 of 23 references.

Closest ancestors · 1

Same direction, newest first

  1. 2023Progress measures for grokking via mechanistic interpretability12 Jan

Other references · 14

  1. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  3. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
  4. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
  5. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  6. 2024Scaling and evaluating sparse autoencoderscited by 553
  7. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 378
  8. 2021On Feature Decorrelation in Self-Supervised Learningcited by 160
  9. 2020Neural collapse with unconstrained featurescited by 142
  10. 2022Extended Unconstrained Features Model for Exploring Deep Neural Collapsecited by 102
  11. 2022On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Featurescited by 97
  12. 2022Posterior Collapse of a Linear Latent Variable Modelcited by 18
2 more
  1. 2024Neural Collapse versus Low-rank Bias: Is Deep Neural Collapse Really Optimal?cited by 17
  2. 2023Towards understanding neural collapse in supervised contrastive learning with the information bottleneck methodcited by 5

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026How are linear representations learned? Exact solutions to the dynamics of abstraction
  2. 2024Collective variables of neural networks: empirical time evolution and scaling laws
  3. 2024Swing-by Dynamics in Concept Learning and Compositional Generalization
  4. 2024State space models, emergence, and ergodicity: How many parameters are needed for stable predictions?
  5. 2024Random Features Hopfield Networks generalize retrieval to previously unseen examples
  6. 2026A Minimal Model of Representation Collapse: Frustration, Stop-Gradient, and Dynamics
  7. 2026Emergent phases of superposition: from partial to full representation
  8. 2025Tracing the Representation Geometry of Language Models from Pretraining to Post-training