paper-with-me

Papers

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

2023-06-28 · Krishnakumar Balasubramanian, Larry Goldstein, Nathan Ross, Adil Salim

We derive upper bounds on the Wasserstein distance ($W_1$), with respect to $\sup$-norm, between any continuous $\mathbb{R}^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 $W_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.

📄 PDF Abstract BibTeX arXiv:2306.16308

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Stochastic Gradient Descent over P2

2026-09-11 · Maria Oprea, Qin Li, Yunan Yang arxiv

Stochastic gradient descent (SGD) admits diffusion approximations that replace the complicated randomness of stochastic gradients by Gaussian noise, providing a powerful tool for understanding its dynamics and long-time …

Stochastic Optimization

Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections

2021-06-29 · NeurIPS 2021 12 · Kimia Nadjahi, Alain Durmus, Pierre E. Jacob, Roland Badeau 외

The Sliced-Wasserstein distance (SW) is being increasingly used in machine learning applications as an alternative to the Wasserstein distance and offers significant computational and statistical benefits. Since it is de…

Fast Approximation of the Generalized Sliced-Wasserstein Distance

2022-10-19 · Dung Le, Huy Nguyen, Khai Nguyen, Trang Nguyen 외

Generalized sliced Wasserstein distance is a variant of sliced Wasserstein distance that exploits the power of non-linear projection through a given defining function to better capture the complex structures of the proba…

Gaussian Process Random Fields

2015-10-31 · NeurIPS 2015 12 · David A. Moore, Stuart J. Russell

Gaussian processes have been successful in both supervised and unsupervised machine learning tasks, but their computational complexity has constrained practical applications. We introduce a new approximation for large-sc…

BIG-bench Machine LearningGaussian Processes

Quantitative Gaussian Approximation of Randomly Initialized Deep Neural Networks

2022-03-14 · Andrea Basteri, Dario Trevisan

Given any deep fully connected neural network, initialized with random Gaussian parameters, we bound from above the quadratic Wasserstein distance between its output distribution and a suitable Gaussian process. Our expl…