Graph Convolutional Gaussian Processes
About
We propose a novel Bayesian nonparametric method to learn translation-invariant relationships on non-Euclidean domains. The resulting graph convolutional Gaussian processes can be applied to problems in machine learning for which the input observations are functions with domains on general graphs. The structure of these models allows for high dimensional inputs while retaining expressibility, as is the case with convolutional neural networks. We present applications of graph convolutional Gaussian processes to images and triangular meshes, demonstrating their versatility and effectiveness, comparing favorably to existing methods, despite being relatively simple models.
Ian Walker, Ben Glocker• 2019
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Image Classification | MNIST standard (test) | Error Rate1.7 | 40 | |
| Handwritten digit classification | Superpixel MNIST 75 vertices (test) | Accuracy0.958 | 7 | |
| Image Classification | MNIST Superpixels (75 nodes) (test) | -- | 7 | |
| Mesh classification | MPI Faust | Error Rate3.33 | 6 |
Showing 4 of 4 rows