SOTAVerified

Low-Dimensional Hyperbolic Knowledge Graph Embeddings

2020-05-01ACL 2020Code Available1· sign in to hype

Ines Chami, Adva Wolf, Da-Cheng Juan, Frederic Sala, Sujith Ravi, Christopher Ré

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Knowledge graph (KG) embeddings learn low-dimensional representations of entities and relations to predict missing facts. KGs often exhibit hierarchical and logical patterns which must be preserved in the embedding space. For hierarchical data, hyperbolic embedding methods have shown promise for high-fidelity and parsimonious representations. However, existing hyperbolic embedding methods do not account for the rich logical patterns in KGs. In this work, we introduce a class of hyperbolic KG embedding models that simultaneously capture hierarchical and logical patterns. Our approach combines hyperbolic reflections and rotations with attention to model complex relational patterns. Experimental results on standard KG benchmarks show that our method improves over previous Euclidean- and hyperbolic-based efforts by up to 6.1% in mean reciprocal rank (MRR) in low dimensions. Furthermore, we observe that different geometric transformations capture different types of relations while attention-based transformations generalize to multiple relations. In high dimensions, our approach yields new state-of-the-art MRRs of 49.6% on WN18RR and 57.7% on YAGO3-10.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
FB15k-237RefEHits@10.26Unverified
WN18RRRotHHits@100.59Unverified
YAGO3-10RefEHits@10.5Unverified

Reproductions