Meta-Weight Graph Neural Network: Push the Limits Beyond Global Homophily
Xiaojun Ma, Qin Chen, Yuanyi Ren, Guojie Song, Liang Wang

TL;DR
This paper introduces MWGNN, a novel GNN model that adaptively constructs node-specific convolution layers based on local distribution modeling, enhancing performance on diverse, non-homophilic graphs.
Contribution
The paper proposes MWGNN, which models node local distributions and generates adaptive graph convolutions, overcoming limitations of traditional GNNs in heterogeneous graph data.
Findings
MWGNN outperforms existing GNNs on real-world benchmarks.
MWGNN effectively handles graphs with diverse and non-homophilic distributions.
Experimental results demonstrate MWGNN's superior expressive power.
Abstract
Graph Neural Networks (GNNs) show strong expressive power on graph data mining, by aggregating information from neighbors and using the integrated representation in the downstream tasks. The same aggregation methods and parameters for each node in a graph are used to enable the GNNs to utilize the homophily relational data. However, not all graphs are homophilic, even in the same graph, the distributions may vary significantly. Using the same convolution over all nodes may lead to the ignorance of various graph patterns. Furthermore, many existing GNNs integrate node features and structure identically, which ignores the distributions of nodes and further limits the expressive power of GNNs. To solve these problems, we propose Meta Weight Graph Neural Network (MWGNN) to adaptively construct graph convolution layers for different nodes. First, we model the Node Local Distribution (NLD)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network · Convolution
