188 citations · 667 across the 24 of their papers we have counts for
4 papers · 1 filter
Understanding over-squashing and bottlenecks on graphs via curvature
Jake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain +2
Most graph neural networks (GNNs) use the message passing paradigm, in which node features are propagated on the input graph. Recent works pointed to the distortion of information…
On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features
Emanuele Rossi, Henry Kenlay, Maria I. Gorinova +3
While Graph Neural Networks (GNNs) have recently become the de facto standard for modeling relational data, they impose a strong assumption on the availability of the node or edge…
Beltrami Flow and Neural Diffusion on Graphs
Benjamin Paul Chamberlain, James Rowbottom, Davide Eynard +3
We propose a novel class of graph neural networks based on the discretised Beltrami flow, a non-Euclidean diffusion PDE. In our model, node features are supplemented with positiona…
GRAND: Graph Neural Diffusion
Benjamin Paul Chamberlain, James Rowbottom, Maria Gorinova +3
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…