mlsanityData to 14 Oct 2026

A simple mean field model of feature learning

arXiv 2510.15174 ↗First posted 16 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Feature learning (FL), where neural networks adapt their internal representations during training, remains poorly understood. Using methods from statistical physics, we derive a tractable, self-consistent mean-field (MF) theory for the Bayesian posterior of two-layer non-linear networks trained with stochastic gradient Langevin dynamics (SGLD). At infinite width, this theory reduces to kernel ridge regression, but at finite width it predicts a symmetry breaking phase transition where networks abruptly align with target functions. While the basic MF theory provides theoretical insight into the emergence of FL in the finite-width regime, semi-quantitatively predicting the onset of FL with noise or sample size, it substantially underestimates the improvements in generalisation after the transition. We trace this discrepancy to a key mechanism absent from the plain MF description: textitself-reinforcing input feature selection. Incorporating this mechanism into the MF theory allows us to quantitatively match the learning curves of SGLD-trained networks and provides mechanistic insight into FL.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 16 Oct 2025.

Builds on

22 of 34 references.

References · 22

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  2. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
  3. 2018On Lazy Training in Differentiable Programmingcited by 675
  4. 2017Deep Neural Networks as Gaussian Processescited by 622
  5. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
  6. 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
  7. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 187
  8. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  9. 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 105
  10. 2022Learning Single-Index Models with Shallow Neural Networkscited by 92
  11. 2020Learning Parities with Neural Networkscited by 78
  12. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
10 more
  1. 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
  2. 2023Grokking as a First Order Phase Transition in Two Layer Networkscited by 48
  3. 2023Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networkscited by 43
  4. 2025Dynamical Decoupling of Generalization and Overfitting in Large Two-Layer Networkscited by 25
  5. 2022Learning sparse features can lead to overfitting in neural networkscited by 23
  6. 2023Local Kernel Renormalization as a mechanism for feature learning in overparametrized Convolutional Neural Networkscited by 19
  7. 2025Adaptive kernel predictors from feature-learning infinite limits of neural networkscited by 13
  8. 2025From Kernels to Features: A Multi-Scale Adaptive Theory of Feature Learningcited by 10
  9. 2024Wilsonian Renormalization of Neural Network Gaussian Processescited by 8
  10. 2024Decoupling Dynamical Richness from Representation Learning: Towards Practical Measurementcited by 2

Built on by

Not cited yet.