A Gaussian Process View on Observation Noise and Initialization in Wide Neural Networks
Not on the map. Why?
Abstract (arXiv)
Performing gradient descent in a wide neural network is equivalent to computing the posterior mean of a Gaussian Process with the Neural Tangent Kernel (NTK-GP), for a specific prior mean and with zero observation noise. However, existing formulations have two limitations: (i) the NTK-GP assumes noiseless targets, leading to misspecification on noisy data; (ii) the equivalence does not extend to arbitrary prior means, which are essential for well-specified models. To address (i), we introduce a regularizer into the training objective, showing its correspondence to incorporating observation noise in the NTK-GP. To address (ii), we propose a textitshifted network that enables arbitrary prior means and allows obtaining the posterior mean with gradient descent on a single network, without ensembling or kernel inversion. We validate our results with experiments across datasets and architectures, showing that this approach removes key obstacles to the practical use of NTK-GP equivalence in applied Gaussian process modeling.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 18 of its 45 references that are in the map. First posted on arXiv 3 Feb 2025.
Builds on
18 of 45 references.
References · 18
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2013Gaussian Processes for Big Datacited by 377
- 2017Doubly Stochastic Variational Inference for Deep Gaussian Processescited by 143
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 139
- 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
- 2020Bayesian Deep Ensembles via the Neural Tangent Kernelcited by 90
- 2020On the training dynamics of deep networks with L2 regularizationcited by 38
- 2020Optimal Rates for Averaged Stochastic Gradient Descent under Neural Tangent Kernel Regimecited by 35
6 more
- 2023Function-Space Regularization in Neural Networks: A Probabilistic Perspectivecited by 20
- 2023Neural Latent Geometry Search: Product Manifold Inference via Gromov-Hausdorff-Informed Bayesian Optimizationcited by 18
- 2024Uncertainty Modeling in Graph Neural Networks via Stochastic Differential Equationscited by 8
- 2017Asynchronous Distributed Variational Gaussian Processes for Regressioncited by 7
- 2024Partially Stochastic Infinitely Deep Bayesian Neural Networkscited by 6
- 2024Epistemic Uncertainty and Observation Noise with the Neural Tangent Kernelcited by 3
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 42
- 2026Richer Bayesian Last Layers with Subsampled NTK Featurescited by 3
- 2025Thompson Sampling in Function Spaces via Neural Operatorscited by 1
- 2026The Neural Tangent Kernel for Classificationcited by 0
- 2026Canonical Regularisation of Wide Feature-Learning Neural Networkscited by 0
- 2026Canonical Regularisation of Wide Feature-Learning Neural Networks18 May 2026
- 2026The Neural Tangent Kernel for Classification17 May 2026
- 2026Richer Bayesian Last Layers with Subsampled NTK Features1 Feb 2026
- 2025Thompson Sampling in Function Spaces via Neural Operators27 Jun 2025
- 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learning15 Feb 2025