English

A simple mean field model of feature learning

Machine Learning 2025-10-20 v1

Abstract

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: \textit{self-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.

Keywords

Cite

@article{arxiv.2510.15174,
  title  = {A simple mean field model of feature learning},
  author = {Niclas Göring and Chris Mingard and Yoonsoo Nam and Ard Louis},
  journal= {arXiv preprint arXiv:2510.15174},
  year   = {2025}
}
R2 v1 2026-07-01T06:42:16.599Z