Law of large numbers and central limit theorem for wide two-layer neural networks: the mini-batch and noisy case
arXiv:2207.12734
Abstract
In this work, we consider a wide two-layer neural network and study the behavior of its empirical weights under a dynamics set by a stochastic gradient descent along the quadratic loss with mini-batches and noise. Our goal is to prove a trajectorial law of large number as well as a central limit theorem for their evolution. When the noise is scaling as 1/N and 1/2 < , we rigorously derive and generalize the LLN obtained for example in [CRBVE20, MMM19, SS20b]. When 3/4 < , we also generalize the CLT (see also [SS20a]) and further exhibit the effect of mini-batching on the asymptotic variance which leads the fluctuations. The case = 3/4 is trickier and we give an example showing the divergence with time of the variance thus establishing the instability of the predictions of the neural network in this case. It is illustrated by simple numerical examples.
References in corpus (7)
- A Mean Field View of the Landscape of Two-Layers Neural Networks
- On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport
- Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limit
- From the master equation to mean field game limit theory: A central limit theorem
- On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity, and Saddle Points
- On the Heavy-Tailed Theory of Stochastic Gradient Descent for Deep Neural Networks
- Quantitative Propagation of Chaos for SGD in Wide Neural Networks