Gaussian Processes on Hypergraphs
arXiv:2106.01982
Abstract
We derive a Matern Gaussian process (GP) on the vertices of a hypergraph. This enables estimation of regression models of observed or latent values associated with the vertices, in which the correlation and uncertainty estimates are informed by the hypergraph structure. We further present a framework for embedding the vertices of a hypergraph into a latent space using the hypergraph GP. Finally, we provide a scheme for identifying a small number of representative inducing vertices that enables scalable inference through sparse GPs. We demonstrate the utility of our framework on three challenging real-world problems that concern multi-class classification for the political party affiliation of legislators on the basis of voting behaviour, probabilistic matrix factorisation of movie reviews, and embedding a hypergraph of animals into a low-dimensional latent space.
arXiv comment25 pages, 6 figures
References in corpus (9)
- Geometric deep learning: going beyond Euclidean data
- Gaussian Processes for Data-Efficient Learning in Robotics and Control
- Elliptical slice sampling
- A Framework for Interdomain and Multioutput Gaussian Processes
- Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks
- A Tutorial on Sparse Gaussian Processes and Variational Inference
- Graph Convolutional Gaussian Processes For Link Prediction
- Stein Variational Gaussian Processes
- Matérn Gaussian Processes on Graphs