Home > Research > Publications & Outputs > Gaussian Processes on Hypergraphs

Electronic data


View graph of relations

Gaussian Processes on Hypergraphs

Research output: Working paperPreprint

Publication date3/06/2021
<mark>Original language</mark>English


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.

Bibliographic note

25 pages, 6 figures