TL;DR
This paper enhances the expressive power of K-hop message-passing GNNs by injecting contextualized substructure information, surpassing previous models and achieving state-of-the-art results on various datasets.
Contribution
It introduces a substructure encoding function and contextualized substructure injection to significantly improve K-hop GNN expressiveness beyond existing methods.
Findings
Provably more powerful than previous K-hop GNNs and 1-WL subgraph GNNs.
Achieves new state-of-the-art performance on multiple datasets.
Matches or exceeds the power of 3-WL.
Abstract
Graph neural networks (GNNs) have become the \textit{de facto} standard for representational learning in graphs, and have achieved state-of-the-art performance in many graph-related tasks; however, it has been shown that the expressive power of standard GNNs are equivalent maximally to 1-dimensional Weisfeiler-Lehman (1-WL) Test. Recently, there is a line of works aiming to enhance the expressive power of graph neural networks. One line of such works aim at developing -hop message-passing GNNs where node representation is updated by aggregating information from not only direct neighbors but all neighbors within -hop of the node. Another line of works leverages subgraph information to enhance the expressive power which is proven to be strictly more powerful than 1-WL test. In this work, we discuss the limitation of -hop message-passing GNNs and propose \textit{substructure…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
