Neural Message Passing on High Order Paths

Daniel Flam-Shepherd, Tony C Wu, Pascal Friederich, Alán Aspuru-Guzik

Main figure for Neural Message Passing on High Order Paths

Abstract

Graph neural network have achieved impressive results in predicting molecular properties, but they do not directly account for local and hidden structures in the graph such as functional groups and molecular geometry. At each propagation step, GNNs aggregate only over first order neighbours, ignoring important information contained in subsequent neighbours as well as the relationships between those higher order connections. In this work, we generalize graph neural nets to pass messages and aggregate across higher order paths. This allows for information to propagate over various levels and substructures of the graph. We demonstrate our model on a few tasks in molecular property prediction.

Benchmark Results

Tested on 1 dataset

Tables show presented results in global context (best 3 papers + GCN + MLP).

Classic

#ModelAccuracy ↑Paper
1
GraphSAGE+CNA
0.9418 ±0.0033
2
GCN+CNA
0.9366 ±0.0048
3
TransformerConv
0.9350 ±0.0058
21
GCN
actual #21 vs paper #573 552 places worse
0.9004
best reported
actual #21 vs paper #573 552 places worse
paper 0.8150
paper 0.8150 Δ at pub 0.0567 Δ today 0.0854
39
SAGE
0.8911 ±0.0012
113
MixHop
actual #113 vs paper #536 423 places worse
0.8761 ±0.0203
best reported
actual #113 vs paper #536 423 places worse
paper 0.8190
476
Path GCN
0.8240
This paper
533
pan
0.8200
This paper
724
MLP
0.7768
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green) Best today — OK at publication; today's leaderboard best is elsewhere