SOTAVerified

Multi-relational Poincaré Graph Embeddings

2019-05-23NeurIPS 2019Code Available0· sign in to hype

Ivana Balažević, Carl Allen, Timothy Hospedales

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

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.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
FB15k-237MuRPHits@10.25Unverified
WN18RRMuRPHits@100.57Unverified

Reproductions