English

Gaussian random field approximation via Stein's method with applications to wide random neural networks

Probability 2024-05-02 v2 Machine Learning Statistics Theory Machine Learning Statistics Theory

Abstract

We derive upper bounds on the Wasserstein distance (W1W_1), with respect to sup\sup-norm, between any continuous Rd\mathbb{R}^d valued random field indexed by the nn-sphere and the Gaussian, based on Stein's method. We develop a novel Gaussian smoothing technique that allows us to transfer a bound in a smoother metric to the W1W_1 distance. The smoothing is based on covariance functions constructed using powers of Laplacian operators, designed so that the associated Gaussian process has a tractable Cameron-Martin or Reproducing Kernel Hilbert Space. This feature enables us to move beyond one dimensional interval-based index sets that were previously considered in the literature. Specializing our general result, we obtain the first bounds on the Gaussian random field approximation of wide random neural networks of any depth and Lipschitz activation functions at the random field level. Our bounds are explicitly expressed in terms of the widths of the network and moments of the random weights. We also obtain tighter bounds when the activation function has three bounded derivatives.

Keywords

Cite

@article{arxiv.2306.16308,
  title  = {Gaussian random field approximation via Stein's method with applications to wide random neural networks},
  author = {Krishnakumar Balasubramanian and Larry Goldstein and Nathan Ross and Adil Salim},
  journal= {arXiv preprint arXiv:2306.16308},
  year   = {2024}
}

Comments

To appear in Applied and Computational Harmonic Analysis