Borovitskiy, V; Azangulov, I; Terenin, A; Mostowsky, P; Deisenroth, MP; Durrande, N; (2021) Matérn Gaussian Processes on Graphs. In: Banerjee, A and Fukumizu, K, (eds.) Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS) 2021. (pp. pp. 2593-2601). PMLR

Preview	Text (Article) Deisenroth_borovitskiy21a.pdf - Published Version Download (2MB) | Preview
Preview	Text (Supplementary Information) Deisenroth_borovitskiy21a-supp.pdf - Published Version Download (1MB) | Preview

Abstract

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´ern Gaussian processes—a widelyused 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´ern 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.

Download activity - last month

Export as CSVXMLJSON

Download activity - last 12 months

Export as XMLJSONCSV

Downloads by country - last 12 months

Export as JSONXMLCSV

Archive Staff Only

View Item