mlsanityData to 7 Oct 2026

Generalisation dynamics of online learning in over-parameterised neural networks

arXiv 1901.09085 ↗First posted 25 Jan 2019stat.ML cond-mat.dis-nn cond-mat.stat-mechcited by 9

Not on the map. Why?

Abstract (arXiv)

Deep neural networks achieve stellar generalisation on a variety of problems, despite often being large enough to easily fit all their training data. Here we study the generalisation dynamics of two-layer neural networks in a teacher-student setup, where one network, the student, is trained using stochastic gradient descent (SGD) on data generated by another network, called the teacher. We show how for this problem, the dynamics of SGD are captured by a set of differential equations. In particular, we demonstrate analytically that the generalisation error of the student increases linearly with the network size, with other relevant parameters held constant. Our results indicate that achieving good generalisation in neural networks depends on the interplay of at least the algorithm, its learning rate, the model architecture, and the data set.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jan 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 3; 2025: 0; 2026: 2.

9 papers.