Convolutional Gaussian Processes

By Mark van der Wilk, Carl E. Rasmussen, James Hensman. 2017

137 citations recorded by the source corpus.

We present a practical way of introducing convolutional structure into Gaussian processes, making them more suited to high-dimensional inputs like images. The main contribution of our work is the construction of an inter-domain inducing point approximation that is well-tailored to the convolutional kernel. This allows us to gain the generalisation benefit of a convolutional kernel, together with fast but accurate posterior inference. We investigate several variations of the convolutional kernel, and apply it to MNIST and CIFAR-10, which have both been known to be challenging for Gaussian processes. We also show how the marginal likelihood can be used to find an optimal weighting between convolutional and RBF kernels to further improve performance. We hope that this illustration of the usefulness of a marginal likelihood will help automate discovering architectures in larger models.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Greg Yang
  2. Ruslan Salakhutdinov
  3. Lechao Xiao
  4. Jaehoon Lee
  5. Simon Shaolei Du
  6. Yuanzhi Li
  7. Jascha Narain Sohl-Dickstein
  8. Jeffrey Pennington

In Computer Vision and Pattern Recognition

  1. Greg Yang
  2. Lechao Xiao
  3. Jaehoon Lee
  4. Ruslan Salakhutdinov
  5. Jeffrey Pennington
  6. Jianfei Cai
  7. Luc Van Gool
  8. Sanjeev Arora

Citations in the corpus