NeurIPS 2019

Hyperbolic Graph Neural Networks

Qi Liu, Maximilian Nickel, Douwe Kiela

Main figure for Hyperbolic Graph Neural Networks

Abstract

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.

Benchmark Results

Tested on 1 dataset

Tables show presented results in global context (best 3 papers + GCN + MLP).

Classic

#ModelMAE ↓Paper
1
TIGT
0.0140 ±0.0010
2
FloydNet
0.0160
3
GSSC
0.0190 ±0.0010
20
Lorentz
0.0240 ±0.0002
This paper
36
MPNN
actual #36 vs paper #47 11 places worse
0.0300
best reported
actual #36 vs paper #47 11 places worse
paper 0.0410 ±0.0002
paper 0.0410 ±0.0002 Δ today 0.0110
38
Poincare
0.0310 ±0.0001
This paper
39
GGNN
0.0320 ±0.0020
This paper
40
Euclidean
0.0330
This paper
46
DTNN
0.0400 ±0.0003
This paper
69
GIN
0.0880 ±0.0020
SOTA performance (not significantly different from the best) Baseline / comparison (this paper) Global context (other papers) Best today — OK at publication; today's leaderboard best is elsewhere