Cited by 384Advanced Graph Neural NetworksTopic ModelingRecommender Systems and Techniques

Low-Dimensional Hyperbolic Knowledge Graph Embeddings

Open access
Chami, Ines, Wolf, Adva, Juan, Da-Cheng, Sala, Frederic, Ravi, Sujith, Ré, Christopher·2020·Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics

Abstract

Knowledge graph (KG) embeddings learn lowdimensional 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 attentionbased 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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2020.acl-main.617

Cites

29 of 29 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Methods for reasoning over KGs that use hyperbolic space (MuRP, RotH) use relational transformations (rotation) that prevent them from faithfully capturing all properties of hierarchical relations.

    “While there are methods for reasoning over KGs that use hyperbolic space (MuRP [15], RotH [16]), which is suitable for modeling tree-like graphs, the choice of relational transformations used in these works (rotation) prevents them from faithfully capturing all the properties of hierarchical relations.”

    From Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones (2021) · cites this paper as [16]

    The paper does not describe MuRP as a rotation model: its Complex embeddings section calls MuRP a translation model. Section 4.2 says rotations can model several logical patterns, and Section 5.6 reports that RotH preserves tree structure. These passages contradict the claim that rotation prevents these methods from faithfully capturing hierarchical relations. (LLM, conf=0.86)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured
  • Transformations used in MuRP and RotH cannot capture transitive relations, which hierarchical relations naturally are.

    “However, transformations used in MuRP and RotH cannot capture transitive relations which hierarchical relations naturally are.”

    From Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones (2021) · cites this paper as [16]

    The discussion of MuRP says it fails to encode some logical properties, but does not identify transitivity as one of them. Section 5.6 says RotH preserves tree structure, and the paper does not say that RotH cannot capture transitive relations. The specific claim about both models therefore exceeds what the source supports. (LLM, conf=0.82)

    Experimental — accuracy not yet measured
  • RotH uses rotation and reflection transformation in n-dimensional Poincaré space to model relational patterns, and achieves state-of-the-art for the KG completion task, especially under low-dimensionality.

    “RotH [16] uses rotation and reflection transformation in n -dimensional Poincaré space to model relational patterns, and achieves state-of-the-art for the KG completion task, especially under low-dimensionality.”

    From Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones (2021) · cites this paper as [16]

    The Ablations passage (WN18RR section; page unavailable) defines RotH as a variant using only rotations, while §4.4 assigns the combination of rotations and reflections to AttH. Figure 5(a) reports improved low-dimensional performance for RotH, but §5.2 attributes the low-dimensional improvements over prior methods to AttH. Thus the claim identifies a relevant hyperbolic KG model but incorrectly assigns reflections and the broad state-of-the-art result to RotH. (LLM, conf=0.90)

    Experimental — accuracy not yet measured
  • The reason RotH needs learning space curvature while ConE does not lies in the choice of embedding space: RotH uses a 2d-dimensional hyperbolic space while ConE uses product space of d hyperbolic planes.

    “The reason why RotH [16] needs learning space curvature while ConE does not lie in the choice of embedding space: RotH uses a 2 d -dimensional hyperbolic space while ConE uses product space of d hyperbolic planes.”

    From Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones (2021) · cites this paper as [16]

    Section 4.1 says the model learns relation-specific curvature, and Section 5.5 reports that fixed curvature degrades RotH's performance in high dimensions. Section 3.2 describes a single d-dimensional Poincaré ball, but the paper does not discuss ConE or establish that the difference in embedding spaces explains why one model learns curvature and the other does not. Pages are not available in our copy. (LLM, conf=0.86)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

4 of the 33 references couldn’t be matched to a known paper.

Research works printed but not linked: 5

  1. Ivana Balažević, Carl Allen, and Timothy Hospedales. 2019. Multi-relational poincaré graph embeddings. In Advances in Neural Information Processing Sys- tems, pages 4465-4475.
  2. Ivana Balazevic, Carl Allen, and Timothy Hospedales. 2019. Tucker: Tensor factorization for knowledge graph completion. In Proceedings of the 2019 Con- ference on Empirical Methods in Natural Language Processing and the 9th International Joint Confer- ence on Natural Language Processing (EMNLP- IJCNLP), pages 5188-5197.
  3. Antoine Bordes, Nicolas Usunier, Alberto Garcia- Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi- relational data. In Advances in Neural Information Processing Systems, pages 2787-2795.
  4. Octavian Ganea, Gary Bécigneul, and Thomas Hof- mann. 2018. Hyperbolic neural networks. In Ad- vances in Neural Information Processing Systems.
  5. Fabian M Suchanek, Gjergji Kasneci, and Gerhard Weikum. 2007. Yago: a core of semantic knowledge. In Proceedings of the 16th international conference on World Wide Web, pages 697-706. ACM.

Cited by

Sorted by citations

Authors
Chami, I., Wolf, A., Juan, D.-C., Sala, F., Ravi, S., & Ré, C.
Affiliations
  • Stanford University (US)
  • Google (United States) (US)
Venue
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
Published
2020
Pages
6901-6914
ISSN
0736-587X (ISSN-L)
OpenAlex
W3023009950
Cited by
384
References
33
Citations by year
2026: 26 · 2025: 55 · 2024: 87 · 2023: 78 · 2022: 59 · 2021: 69 · 2020: 10
FWCI
20.63
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1763315, 1563078, 1937301)
  • Gordon and Betty Moore Foundation
  • Accenture
  • VMware
  • Okawa Foundation for Information and Telecommunications
  • Swiss Re
  • Ant Financial Services Group
  • National Institutes of Health (N000141712266)
  • Defense Advanced Research Projects Agency (FA86501827882, FA86501827865)
  • Office of Naval Research (N000141712266)
  • National Institute of Biomedical Imaging and Bioengineering (U54EB020405)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
Keywords
knowledge graph embedding, hyperbolic embeddings, hyperbolic geometry, hyperbolic reflections, hyperbolic rotations, attention mechanism, hierarchical relations, logical relations, low-dimensional representation, missing fact prediction

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review