Hyperbolic Graph Neural Networks
About
Learning from graph-structured data is an important task in machine learning and artificial intelligence, for which Graph Neural Networks (GNNs) have shown great promise. Motivated by recent advances in geometric representation learning, we propose a novel GNN architecture for learning representations on Riemannian manifolds with differentiable exponential and logarithmic maps. We develop a scalable algorithm for modeling the structural properties of graphs, comparing Euclidean and hyperbolic geometry. In our experiments, we show that hyperbolic GNNs can lead to substantial improvements on various benchmark datasets.
Qi Liu, Maximilian Nickel, Douwe Kiela• 2019
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Node Classification | Pubmed | Accuracy76.94 | 627 | |
| Node Classification | Citeseer | Accuracy70.2 | 541 | |
| Node Classification | Photo | Mean Accuracy91.82 | 447 | |
| Node Classification | wikiCS | Accuracy74.89 | 329 | |
| Graph Classification | D&D Standard | Accuracy75.8 | 7 | |
| Graph Classification | PROTEINS Standard | Accuracy73.7 | 7 | |
| Graph Classification | ENZYMES Standard | Accuracy51.3 | 7 | |
| Graph Classification | Synthetic Graphs (2880) | Mean F1 Score76.6 | 4 | |
| Graph Classification | Synthetic Graphs (90 graphs) | Mean F1 Score41.8 | 4 | |
| Graph Classification | Synthetic Graphs 180 | Mean F1 Score41.3 | 4 |
Showing 10 of 12 rows