Adaptive Gaussian Processes on Graphs via Spectral Graph Wavelets
arXiv:2110.12752
Abstract
Graph-based models require aggregating information in the graph from neighbourhoods of different sizes. In particular, when the data exhibit varying levels of smoothness on the graph, a multi-scale approach is required to capture the relevant information. In this work, we propose a Gaussian process model using spectral graph wavelets, which can naturally aggregate neighbourhood information at different scales. Through maximum likelihood optimisation of the model hyperparameters, the wavelets automatically adapt to the different frequencies in the data, and as a result our model goes beyond capturing low frequency information. We achieve scalability to larger graphs by using a spectrum-adaptive polynomial approximation of the filter function, which is designed to yield a low approximation error in dense areas of the graph spectrum. Synthetic and real-world experiments demonstrate the ability of our model to infer scales accurately and produce competitive performances against state-of-the-art models in graph-based learning tasks.
References in corpus (6)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Hierarchical structure and the prediction of missing links in networks
- Hierarchical Organization in Complex Networks
- Simplifying Graph Convolutional Networks
- Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning
- Graph Convolutional Gaussian Processes For Link Prediction