pith. sign in

arxiv: 1805.01053 · v4 · pith:L3CXGFG2new · submitted 2018-05-02 · 🧮 math.PR

Mean Field Analysis of Neural Networks: A Law of Large Numbers

classification 🧮 math.PR
keywords neuralnetworkslargenetworkanalysisnumbersapplicationsparameters
0
0 comments X
read the original abstract

Machine learning, and in particular neural network models, have revolutionized fields such as image, text, and speech recognition. Today, many important real-world applications in these areas are driven by neural networks. There are also growing applications in engineering, robotics, medicine, and finance. Despite their immense success in practice, there is limited mathematical understanding of neural networks. This paper illustrates how neural networks can be studied via stochastic analysis, and develops approaches for addressing some of the technical challenges which arise. We analyze one-layer neural networks in the asymptotic regime of simultaneously (A) large network sizes and (B) large numbers of stochastic gradient descent training iterations. We rigorously prove that the empirical distribution of the neural network parameters converges to the solution of a nonlinear partial differential equation. This result can be considered a law of large numbers for neural networks. In addition, a consequence of our analysis is that the trained parameters of the neural network asymptotically become independent, a property which is commonly called "propagation of chaos".

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Geometric Dyson Brownian Motions and the Free Log-Normal Limit for a Non-Square Product of Random Matrices

    math.PR 2026-06 unverdicted novelty 7.0

    In double asymptotic limits, the squared singular value process of non-square matrix products obeys geometric Dyson Brownian motion whose T-transform solves a Burgers equation, producing the free log-normal law via fr...

  2. Balancing structure and randomness: maximum entropy networks for context-dependent computations

    q-bio.NC 2026-05 unverdicted novelty 7.0

    Maximum entropy inference on weight distributions under context-dependent task constraints produces neuron populations with contextual gain modulation whose connectivity matches gradient-descent trained networks, with...

  3. Distributional Spectral Diagnostics for Localizing Grokking Transitions

    cs.LG 2026-05 unverdicted novelty 6.0

    A residual from Hankel DMD on Wasserstein-mapped training distributions localizes grokking transitions in modular-addition Transformers with AUROC 0.93 and can precede onset under a sustained-threshold rule.