MLLGNov 1, 2017

Deep Neural Networks as Gaussian Processes

arXiv:1711.00165v31242 citations
Originality Highly original
AI Analysis

This provides a foundational theoretical link for Bayesian deep learning, allowing exact inference and uncertainty quantification for deep networks, which is incremental but builds on prior work on single-layer networks.

The paper tackled the problem of establishing an exact equivalence between infinitely wide deep neural networks and Gaussian processes (GPs), enabling fully Bayesian inference for deep networks, and found that GP predictions typically outperform finite-width networks on MNIST and CIFAR-10, with test performance increasing as networks become wider and more similar to GPs.

It has long been known that a single-layer fully-connected neural network with an i.i.d. prior over its parameters is equivalent to a Gaussian process (GP), in the limit of infinite network width. This correspondence enables exact Bayesian inference for infinite width neural networks on regression tasks by means of evaluating the corresponding GP. Recently, kernel functions which mimic multi-layer random neural networks have been developed, but only outside of a Bayesian framework. As such, previous work has not identified that these kernels can be used as covariance functions for GPs and allow fully Bayesian prediction with a deep neural network. In this work, we derive the exact equivalence between infinitely wide deep networks and GPs. We further develop a computationally efficient pipeline to compute the covariance function for these GPs. We then use the resulting GPs to perform Bayesian inference for wide deep neural networks on MNIST and CIFAR-10. We observe that trained neural network accuracy approaches that of the corresponding GP with increasing layer width, and that the GP uncertainty is strongly correlated with trained network prediction error. We further find that test performance increases as finite-width trained networks are made wider and more similar to a GP, and thus that GP predictions typically outperform those of finite-width networks. Finally we connect the performance of these GPs to the recent theory of signal propagation in random neural networks.

Code Implementations7 repos

Data from Papers with Code (CC-BY-SA-4.0)

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes