Matérn Gaussian Processes on Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916016413474816 |
|---|---|
| author | Borovitskiy, Viacheslav Azangulov, Iskander Terenin, Alexander Mostowsky, Peter Deisenroth, Marc Peter Durrande, Nicolas |
| author_facet | Borovitskiy, Viacheslav Azangulov, Iskander Terenin, Alexander Mostowsky, Peter Deisenroth, Marc Peter Durrande, Nicolas |
| contents | Gaussian processes are a versatile framework for learning unknown functions in a manner that permits one to utilize prior information about their properties. Although many different Gaussian process models are readily available when the input space is Euclidean, the choice is much more limited for Gaussian processes whose input space is an undirected graph. In this work, we leverage the stochastic partial differential equation characterization of Matérn Gaussian processes - a widely-used model class in the Euclidean setting - to study their analog for undirected graphs. We show that the resulting Gaussian processes inherit various attractive properties of their Euclidean and Riemannian analogs and provide techniques that allow them to be trained using standard methods, such as inducing points. This enables graph Matérn Gaussian processes to be employed in mini-batch and non-conjugate settings, thereby making them more accessible to practitioners and easier to deploy within larger learning frameworks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2010_15538 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Matérn Gaussian Processes on Graphs Borovitskiy, Viacheslav Azangulov, Iskander Terenin, Alexander Mostowsky, Peter Deisenroth, Marc Peter Durrande, Nicolas Machine Learning Gaussian processes are a versatile framework for learning unknown functions in a manner that permits one to utilize prior information about their properties. Although many different Gaussian process models are readily available when the input space is Euclidean, the choice is much more limited for Gaussian processes whose input space is an undirected graph. In this work, we leverage the stochastic partial differential equation characterization of Matérn Gaussian processes - a widely-used model class in the Euclidean setting - to study their analog for undirected graphs. We show that the resulting Gaussian processes inherit various attractive properties of their Euclidean and Riemannian analogs and provide techniques that allow them to be trained using standard methods, such as inducing points. This enables graph Matérn Gaussian processes to be employed in mini-batch and non-conjugate settings, thereby making them more accessible to practitioners and easier to deploy within larger learning frameworks. |
| title | Matérn Gaussian Processes on Graphs |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2010.15538 |