Beltrami Flow and Neural Diffusion on Graphs
About
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 positional encodings derived from the graph topology and jointly evolved by the Beltrami flow, producing simultaneously continuous feature learning and topology evolution. The resulting model generalises many popular graph neural networks and achieves state-of-the-art results on several benchmarks.
Benjamin Paul Chamberlain, James Rowbottom, Davide Eynard, Francesco Di Giovanni, Xiaowen Dong, Michael M Bronstein• 2021
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Node Classification | Cora | Accuracy88.09 | 885 | |
| Node Classification | Citeseer | Accuracy76.63 | 804 | |
| Node Classification | Pubmed | Accuracy89.24 | 742 | |
| Node Classification | Chameleon | Accuracy60.11 | 549 | |
| Node Classification | Squirrel | Accuracy43.06 | 500 | |
| Node Classification | Cornell | Accuracy85.95 | 426 | |
| Node Classification | Texas | Accuracy83.24 | 410 | |
| Node Classification | Wisconsin | Accuracy84.12 | 410 | |
| Node Classification | Pubmed | Accuracy89.24 | 307 | |
| Node Classification | Film | Accuracy35.63 | 127 |
Showing 10 of 20 rows