Skip to yearly menu bar Skip to main content


Graph-Structured Gaussian Processes for Transferable Graph Learning

Jun Wu · Lisa Ainsworth · Andrew Leakey · Haixun Wang · Jingrui He

Great Hall & Hall B1+B2 (level 1) #2004
[ ]
Thu 14 Dec 8:45 a.m. PST — 10:45 a.m. PST


Transferable graph learning involves knowledge transferability from a source graph to a relevant target graph. The major challenge of transferable graph learning is the distribution shift between source and target graphs induced by individual node attributes and complex graph structures. To solve this problem, in this paper, we propose a generic graph-structured Gaussian process framework (GraphGP) for adaptively transferring knowledge across graphs with either homophily or heterophily assumptions. Specifically, GraphGP is derived from a novel graph structure-aware neural network in the limit on the layer width. The generalization analysis of GraphGP explicitly investigates the connection between knowledge transferability and graph domain similarity. Extensive experiments on several transferable graph learning benchmarks demonstrate the efficacy of GraphGP over state-of-the-art Gaussian process baselines.

Chat is not available.