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.
GRAND: Graph Neural Diffusion
Graph Neural Diffusion (GRAND) treats graph learning as a continuous diffusion process, addressing issues like depth and oversmoothing with both linear and nonlinear versions achieving competitive results.
- Year
- 2021
- Venue
- NeurIPS Workshop DLDE 2021 12
- Authors
- 6
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/2106.10934v2ARXIV-DEFAULT
- TL;DR
- Semantic Scholar