A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs
Abstract
Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the context of knowledge graphs. Our goal is to provide a systematic understanding of the landscape of graph neural networks for knowledge graphs pertaining to the prominent task of link prediction. Our analysis entails a unifying perspective on seemingly unrelated models and unlocks a series of other models. The expressive power of various models is characterized via a corresponding relational Weisfeiler-Leman algorithm. This analysis is extended to provide a precise logical characterization of the class of functions captured by a class of graph neural networks. The theoretical findings presented in this paper explain the benefits of some widely employed practical design choices, which are validated empirically.
Benchmark Results
Tested on 3 datasets 2 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
OGB
| # | Model | MRR ↑ | Paper |
|---|---|---|---|
| 1 | PairRE+LRE | 0.8360 | |
| 2 | NBFnet | 0.8317 | |
| 3 | AutoSF | 0.8309
±0.0008 | |
| 10 | C-MPNN | 0.7900 | This paper |
| 12 | RGCN | 0.6360 | This paper |
Knowledge Graphs
WN18RR
Global leaderboard →Default metric is MRR. The paper reports 5 values on MRR and 15 values on Hits@10 .
| # | Model | MRR ↑ default | Hits@10 ↑ | Paper |
|---|---|---|---|---|
| 1 | C-MPNN (PNA, Msg_r^2, f(t)=t, Init^2, no readout) | —
| 0.9470 | Hits@10
0.9470 |
| 1 | C-MPNN (PNA, Msg_r^3, f(t)=0, Init^2, no readout) | —
| 0.9470 | Hits@10
0.9470 |
| 1 | C-MPNN (PNA, Msg_r^2, f(t)=0, Init^2, no readout) | —
| 0.9460 | Hits@10
0.9460 |
| 1 | C-MPNN (PNA, Msg_r^1, f(t)=t, Init^2, global readout) | —
| 0.9460 | Hits@10
0.9460 |
| 1 | C-MPNN (PNA, Msg_r^3, f(t)=t, Init^2, no readout) | —
| 0.9440 | Hits@10
0.9440 |
| 1 | C-MPNN (sum, Msg_r^3, f(t)=0, Init^2, no readout) | —
| 0.9430 | Hits@10
0.9430 |
| 1 | C-MPNN (PNA, Msg_r^1, f(t)=0, Init^2, no readout) | —
| 0.9430 | Hits@10
0.9430 |
| 1 | C-MPNN (PNA, Msg_r^1, f(t)=t, Init^2, no readout) | —
| 0.9410 | Hits@10
0.9410 |
| 1 | C-MPNN (sum, Msg_r^2, f(t)=0, Init^2, no readout) | —
| 0.9390 | Hits@10
0.9390 |
| 1 | C-MPNN (sum, Msg_r^2, f(t)=t, Init^2, no readout) | —
| 0.9370 | Hits@10
0.9370 |
| 1 | C-MPNN (sum, Msg_r^1, f(t)=0, Init^2, no readout) | —
| 0.9340 | Hits@10
0.9340 |
| 1 | C-MPNN (sum, Msg_r^3, f(t)=t, Init^2, no readout) | —
| 0.9340 | Hits@10
0.9340 |
| 1 | C-MPNN | —
| 0.9320 | Hits@10
0.9320 |
| 1 | C-MPNN (sum, Msg_r^1, f(t)=t, Init^2, no readout) | —
| 0.9320 | Hits@10
0.9320 |
| 1 | C-MPNN (PNA, Msg_r^1, f(t)=t, Init^2, relation-specific readout) | —
| 0.9320 | Hits@10
0.9320 |
| 1 | FedSage | 0.8426
±
0.0026 | — | |
| 2 | FED-PUB | 0.8348
±
0.0025 | — | |
| 3 | FedAvg | 0.8252
±
0.0023 | — | |
| 7 | GCN | 0.8171
±
0.0030 | — | |
| 11 | NeuralLP | 0.7440 | — | Hits@10
— |
| 12 | DRUM | 0.7440 | — | Hits@10
— prev best: Knowledge Graph Reasoning with Relational Digraph (WWW 2021) |
| 35 | C-MPNN-basic | 0.5340 | — | Hits@10
— |
| 60 | CompGCN | 0.4790 best reported | — | Hits@10
— best at pub: Composition-based Multi-Relational Graph Convolutional Networks (ICLR 2019) best today: KnowFormer: Revisiting Transformers for Knowledge Graph Reasoning (ICML 2024) |
| 92 | RGCN | 0.4270 best reported | — | Hits@10
— |
FB15k-237
Global leaderboard →Default metric is MRR. The paper reports 7 values on MRR and 9 values on Hits@10 .
| # | Model | MRR ↑ default | Hits@10 ↑ | Paper |
|---|---|---|---|---|
| 1 | sum, Msg_r^3, f(t)=0 | 0.8500 | — | Hits@10
— |
| 2 | sum, Msg_r^3, f(t)=t | 0.8440 | — | Hits@10
— |
| 3 | C-MPNN relation-specific readout (PNA, Msg_r^1, f(t)=t, Init^2) | —
| 0.8350 | Hits@10
0.8350 |
| 3 | C-MPNN (PNA, Msg_r^1, f(t)=t) | —
| 0.8040 | Hits@10
0.8040 |
| 3 | C-MPNN no readout (PNA, Msg_r^1, f(t)=t, Init^2) | —
| 0.8040 | Hits@10
0.8040 |
| 3 | PNA, Msg_r^1, f(t)=0 | 0.8010 | — | Hits@10
— |
| 4 | C-MPNN global readout (PNA, Msg_r^1, f(t)=t, Init^2) | —
| 0.7990 | Hits@10
0.7990 |
| 4 | C-MPNN (PNA, Msg_r^3, f(t)=t) | —
| 0.7950 | Hits@10
0.7950 |
| 5 | C-MPNN (basic, sum, Msg_r^1, f(t)=t, Init^2, no readout) | —
| 0.7940 | Hits@10
0.7940 |
| 4 | sum, Msg_r^1, f(t)=t | 0.7940 | — | Hits@10
— |
| 5 | C-MPNN (PNA, Msg_r^3, f(t)=0) | —
| 0.7880 | Hits@10
0.7880 |
| 5 | sum, Msg_r^1, f(t)=0 | 0.7840 | — | Hits@10
— |
| 6 | sum, Msg_r^2, f(t)=0 | 0.7340 | — | Hits@10
— |
| 7 | sum, Msg_r^2, f(t)=t | 0.7280 | — | Hits@10
— |
| 8 | C-MPNN (PNA, Msg_r^2, f(t)=0) | —
| 0.7150 | Hits@10
0.7150 |
| 8 | C-MPNN (PNA, Msg_r^2, f(t)=t) | —
| 0.7090 | Hits@10
0.7090 |
