Multi-relational Poincaré Graph Embeddings

Hyperbolic embeddings have recently gained attention in machine learning due to their ability to represent hierarchical data more accurately and succinctly than their Euclidean analogues. However, multi-relational knowledge graphs often exhibit multiple simultaneous hierarchies, which current hyperbolic models do not capture. To address this, we propose a model that embeds multi-relational graph data in the Poincar\'e ball model of hyperbolic space. Our Multi-Relational Poincar\'e model (MuRP) learns relation-specific parameters to transform entity embeddings by M\"obius matrix-vector multiplication and M\"obius addition. Experiments on the hierarchical WN18RR knowledge graph show that our Poincar\'e embeddings outperform their Euclidean counterpart and existing embedding methods on the link prediction task, particularly at lower dimensionality.

PDF Abstract NeurIPS 2019 PDF NeurIPS 2019 Abstract

Results from the Paper

Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Link Prediction FB15k-237 MuRP MRR 0.336 # 40
Hits@10 0.521 # 37
Hits@3 0.370 # 30
Hits@1 0.245 # 33
Link Prediction WN18RR MuRP MRR 0.481 # 29
Hits@10 0.566 # 33
Hits@3 0.495 # 25
Hits@1 0.440 # 30


No methods listed for this paper. Add relevant methods here