Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

GRAND: Graph Neural Diffusion

About

We present Graph Neural Diffusion (GRAND) that approaches deep learning on graphs as a continuous diffusion process and treats Graph Neural Networks (GNNs) as discretisations of an underlying PDE. In our model, the layer structure and topology correspond to the discretisation choices of temporal and spatial operators. Our approach allows a principled development of a broad new class of GNNs that are able to address the common plights of graph learning models such as depth, oversmoothing, and bottlenecks. Key to the success of our models are stability with respect to perturbations in the data and this is addressed for both implicit and explicit discretisation schemes. We develop linear and nonlinear versions of GRAND, which achieve competitive results on many standard graph benchmarks.

Benjamin Paul Chamberlain, James Rowbottom, Maria Gorinova, Stefan Webb, Emanuele Rossi, Michael M. Bronstein• 2021

Related benchmarks

TaskDatasetResultRank
Graph ClassificationPROTEINS
Accuracy69.77
1252
Node ClassificationCora
Accuracy87.36
1215
Graph ClassificationMUTAG
Accuracy61.26
1103
Node ClassificationCiteseer
Accuracy76.46
1037
Node ClassificationCora (test)
Mean Accuracy83.45
951
Node ClassificationCiteseer (test)
Accuracy0.7516
945
Node ClassificationChameleon
Accuracy68.43
867
Node ClassificationPubmed
Accuracy89.02
865
Node ClassificationWisconsin
Accuracy83.08
864
Node ClassificationCornell
Accuracy82.46
851
Showing 10 of 100 rows
...

Other info

Follow for update