Graph Neural Ordinary Differential Equations
About
We introduce the framework of continuous--depth graph neural networks (GNNs). Graph neural ordinary differential equations (GDEs) are formalized as the counterpart to GNNs where the input-output relationship is determined by a continuum of GNN layers, blending discrete topological structures and differential equations. The proposed framework is shown to be compatible with various static and autoregressive GNN models. Results prove general effectiveness of GDEs: in static settings they offer computational advantages by incorporating numerical methods in their forward pass; in dynamic settings, on the other hand, they are shown to improve performance by exploiting the geometry of the underlying dynamics.
Michael Poli, Stefano Massaroli, Junyoung Park, Atsushi Yamashita, Hajime Asama, Jinkyoo Park• 2019
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Node Classification | Cora | Accuracy87.22 | 885 | |
| Node Classification | Citeseer | Accuracy76.21 | 804 | |
| Node Classification | Chameleon | Accuracy47.76 | 549 | |
| Node Classification | Squirrel | Accuracy35.94 | 500 | |
| Node Classification | Cornell | Accuracy82.43 | 426 | |
| Node Classification | Texas | Accuracy74.05 | 410 | |
| Node Classification | Wisconsin | Accuracy79.8 | 410 | |
| Node Classification | Pubmed | Accuracy87.8 | 307 | |
| Node Classification | Citeseer | Accuracy71.8 | 275 | |
| Node Classification | Photo | Mean Accuracy92.4 | 165 |
Showing 10 of 34 rows