MLLGJul 3, 2021

Scale Mixtures of Neural Network Gaussian Processes

arXiv:2107.01408v27 citations
Originality Incremental advance
AI Analysis

This work addresses the need for more flexible stochastic processes in machine learning, particularly for improving robustness in out-of-distribution scenarios, though it is incremental as it builds directly on existing NNGP frameworks.

The authors tackled the limitation of Neural Network Gaussian Processes (NNGPs) by proposing scale mixtures of NNGPs, which introduce a prior distribution on the scale of last-layer parameters to create richer stochastic processes, including heavy-tailed ones like Student's t processes, and demonstrated robustness to out-of-distribution data in regression and classification tasks.

Recent works have revealed that infinitely-wide feed-forward or recurrent neural networks of any architecture correspond to Gaussian processes referred to as Neural Network Gaussian Processes (NNGPs). While these works have extended the class of neural networks converging to Gaussian processes significantly, however, there has been little focus on broadening the class of stochastic processes that such neural networks converge to. In this work, inspired by the scale mixture of Gaussian random variables, we propose the scale mixture of NNGPs for which we introduce a prior distribution on the scale of the last-layer parameters. We show that simply introducing a scale prior on the last-layer parameters can turn infinitely-wide neural networks of any architecture into a richer class of stochastic processes. With certain scale priors, we obtain heavy-tailed stochastic processes, and in the case of inverse gamma priors, we recover Student's $t$ processes. We further analyze the distributions of the neural networks initialized with our prior setting and trained with gradient descents and obtain similar results as for NNGPs. We present a practical posterior-inference algorithm for the scale mixture of NNGPs and empirically demonstrate its usefulness on regression and classification tasks. In particular, we show that in both tasks, the heavy-tailed stochastic processes obtained from our framework are robust to out-of-distribution data.

Code Implementations1 repo
Foundations

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

Your Notes