GRAND: Graph Neural Diffusion
Abstract
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.
Cite
Text
Chamberlain et al. "GRAND: Graph Neural Diffusion." International Conference on Machine Learning, 2021.Markdown
[Chamberlain et al. "GRAND: Graph Neural Diffusion." International Conference on Machine Learning, 2021.](https://mlanthology.org/icml/2021/chamberlain2021icml-grand/)BibTeX
@inproceedings{chamberlain2021icml-grand,
title = {{GRAND: Graph Neural Diffusion}},
author = {Chamberlain, Ben and Rowbottom, James and Gorinova, Maria I and Bronstein, Michael and Webb, Stefan and Rossi, Emanuele},
booktitle = {International Conference on Machine Learning},
year = {2021},
pages = {1407-1418},
volume = {139},
url = {https://mlanthology.org/icml/2021/chamberlain2021icml-grand/}
}