Graph-Structured Gaussian Processes for Transferable Graph Learning
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.Submission Number: 13750
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi-Output Gaussian Processes for Graph-Structured Data
Graph-structured data is a type of data to be obtained associated with a graph structure where vertices and edges describe some kind of data correlation. This paper proposes a regression method on graph-structured data, …
Gaussian ProcessesModel SelectionEvolving-Graph Gaussian Processes
Graph Gaussian Processes (GGPs) provide a data-efficient solution on graph structured domains. Existing approaches have focused on static structures, whereas many real graph data represent a dynamic structure, limiting t…
Gaussian ProcessesregressionTime SeriesTime Series Analysis+1Graph Convolutional Gaussian Processes For Link Prediction
Link prediction aims to reveal missing edges in a graph. We address this task with a Gaussian process that is transformed using simplified graph convolutions to better leverage the inductive bias of the domain. To scale …
Gaussian ProcessesGraph Neural NetworkInductive BiasLink Prediction+1Infinite Width Graph Neural Networks for Node Regression/ Classification
This work analyzes Graph Neural Networks, a generalization of Fully-Connected Deep Neural Nets on Graph structured data, when their width, that is the number of nodes in each fullyconnected layer is increasing to infinit…
Gaussian ProcessesGraph AttentionGraph LearningGraph Neural Network+3Graph Neural Networks for Scalable and Transferable Node Centrality Approximation
Graph Neural Networks (GNNs) provide a learning-based framework for approximating graph quantities that are expensive to compute exactly. This paper investigates GNNs for scalable approximation of betweenness and closene…