mlsanityData to 7 Oct 2026

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

arXiv 2306.16308 ↗First posted 28 Jun 2023math.PR cs.LG math.STcited by 10

Not on the map. Why?

Abstract (arXiv)

We derive upper bounds on the Wasserstein distance (W1), with respect to sup-norm, between any continuous ℝd valued random field indexed by the n-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 W1 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.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 21 of its 66 references that are in the map. First posted on arXiv 28 Jun 2023.

Builds on

21 of 66 references.

References · 21

  1. 2017Deep Neural Networks as Gaussian Processescited by 617
  2. 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
  3. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  4. 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 148
  5. 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
  6. 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
  7. 2021Bayesian Neural Network Priors Revisitedcited by 121
  8. 2018Mean Field Analysis of Neural Networks: A Central Limit Theoremcited by 107
  9. 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 105
  10. 2021Random Neural Networks in the Infinite Width Limit as Gaussian Processescited by 43
  11. 2022The Neural Covariance SDE: Shaped Infinite Depth-and-Width Networks at Initializationcited by 41
  12. 2022Quantitative Gaussian Approximation of Randomly Initialized Deep Neural Networkscited by 24
9 more
  1. 2020A Dynamical Central Limit Theorem for Shallow Neural Networkscited by 22
  2. 2021Non-asymptotic approximations of neural networks by Gaussian processescited by 18
  3. 2022Deep neural networks with dependent weights: Gaussian Process mixture limit, heavy tails, sparsity and compressibilitycited by 13
  4. 2021Rate of Convergence of Polynomial Networks to Gaussian Processescited by 12
  5. 2023Non-asymptotic approximations of Gaussian neural networks via second-order Poincar'e inequalitiescited by 10
  6. 2021Deep Stable neural networks: large-width asymptotics and convergence ratescited by 8
  7. 2021α-Stable convergence of heavy-tailed infinitely-wide neural networkscited by 5
  8. 2023High-dimensional scaling limits and fluctuations of online least-squares SGD with smooth covariancecited by 5
  9. 2023Infinitely wide limits for deep Stable neural networks: sub-linear, linear and super-linear activation functionscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 4; 2026: 2.

10 papers.