## Normal approximation of random Gaussian neural networks

In this talk we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian neural network and (the law of) a random Gaussian vector. Our main results concern deep random Gaussian neural networks, with a rather general activation function. The upper bounds show how the widths of the layers, the activation function and other architecture parameters aect the Gaussian approximation of the output. Our techniques, relying on Stein's method and integration by parts formulas for the Gaussian law, yield estimates on distances which are indeed integral probability metrics, and include the convex distance. This latter metric is dened by testing against indicator functions of measurable convex sets, and so allows for accurate estimates of the probability that the output is localized in some region of the space. Such estimates have a signicant interest both from a practitioner's and a theorist's perspective.

Area: CS24 - Neural Networks at initialization (Michele Salvi)

Keywords: Neural Networks

Please Login in order to download this file