Statistical mechanics of extensive-width Bayesian neural networks near interpolation

arXiv:2505.24849v11 citationsh-index: 8
Originality Incremental advance
AI Analysis

This work addresses the gap between practical neural networks and theoretical models for researchers in statistical physics and machine learning, though it is incremental in extending prior frameworks to more realistic network architectures.

The paper tackles the theoretical understanding of two-layer Bayesian neural networks with extensive width, analyzing their learning behavior near interpolation where feature learning emerges. It uncovers a rich phenomenology with various learning transitions as data increases, showing that stronger feature contributions require less data to learn and that specialization occurs only with sufficient data.

For three decades statistical mechanics has been providing a framework to analyse neural networks. However, the theoretically tractable models, e.g., perceptrons, random features models and kernel machines, or multi-index models and committee machines with few neurons, remained simple compared to those used in applications. In this paper we help reducing the gap between practical networks and their theoretical understanding through a statistical physics analysis of the supervised learning of a two-layer fully connected network with generic weight distribution and activation function, whose hidden layer is large but remains proportional to the inputs dimension. This makes it more realistic than infinitely wide networks where no feature learning occurs, but also more expressive than narrow ones or with fixed inner weights. We focus on the Bayes-optimal learning in the teacher-student scenario, i.e., with a dataset generated by another network with the same architecture. We operate around interpolation, where the number of trainable parameters and of data are comparable and feature learning emerges. Our analysis uncovers a rich phenomenology with various learning transitions as the number of data increases. In particular, the more strongly the features (i.e., hidden neurons of the target) contribute to the observed responses, the less data is needed to learn them. Moreover, when the data is scarce, the model only learns non-linear combinations of the teacher weights, rather than "specialising" by aligning its weights with the teacher's. Specialisation occurs only when enough data becomes available, but it can be hard to find for practical training algorithms, possibly due to statistical-to-computational~gaps.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes