Wide neural networks with general weights: convergence rate and explicit dependence on the hyper-parameters
Lucia Celli

TL;DR
This paper establishes explicit convergence rates of wide neural networks with general weights to Gaussian processes, using Stein's method, and explores the effects of increasing depth alongside width.
Contribution
It provides the first CLT for neural networks with Lipschitz activations and non-Gaussian weights in the simultaneous infinite width and depth regime.
Findings
Convergence rate of O(n^{-1/2}) in total variation and Wasserstein distances.
Bounds are explicit and computable for finite collections of inputs.
Novel CLT results for networks with non-Gaussian weights and increasing depth.
Abstract
Using Stein's method techniques introduced by Chatterjee (2008) and further extended by Kasprzak and Peccati (2022) and by Lachi\`eze-Rey and Peccati (2017), we derive novel quantitative bounds on the convergence in distribution of feed-forward fully connected neural networks (with Lipschitz activation functions) towards Gaussian processes, as the hidden layer width tends to infinity. We consider networks initialized with independent and identically distributed (i.i.d.) weights possessing sufficiently many finite moments, and i.i.d. Gaussian biases independent of the weights. Specifically, when the network is evaluated at a single input, we obtain convergence rates of order in both total variation and Wasserstein distances. When evaluated at a general finite collection of inputs, we establish bounds of the same order in terms of the convex distance. All bounds are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Random Matrices and Applications · Markov Chains and Monte Carlo Methods
