Challenge: Existing studies have shown that the choice of space for knowledge graph (KG) embeddings has significant effects on the performance of KG completion tasks.
Approach: They propose to use the Fourier transform to convert between real and complex hyperbolic space to capture hierarchical patterns.
Outcome: The proposed models outperform the baseline models for knowledge graph (KG) embeddings.

Similar Papers

Low-Dimensional Hyperbolic Knowledge Graph Embeddings (2020.acl-main)

Copied to clipboard

Challenge: Existing methods for predicting missing facts do not account for hierarchical and logical patterns in KGs.
Approach: They propose a class of hyperbolic KG embedding models that capture hierarchical and logical patterns.
Outcome: Experimental results show that the proposed method improves by 6.1% in mean reciprocal rank in low dimensions over previous methods.
Knowledge Association with Hyperbolic Knowledge Graph Embeddings (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods for knowledge graphs (KGs) depend on high embedding dimensions and hierarchical structures to achieve expressiveness.
Approach: They propose a hyperbolic relational graph neural network for KG embedding and capture knowledge associations with a high-dimensional transformation.
Outcome: Experiments on entity alignment and type inference show the proposed method is effective and efficient.
Hyperbolic Geometry is Not Necessary: Lightweight Euclidean-Based Models for Low-Dimensional Knowledge Graph Embeddings (2021.findings-emnlp)

Copied to clipboard

Challenge: Recent knowledge graph embedding models based on hyperbolic geometry are complicated than Euclidean operations.
Approach: They propose to use hyperbolic geometry to generate high-fidelity and parsimonious representations of hierarchical patterns in knowledge graphs.
Outcome: The proposed models achieve state-of-the-art performance on two widely-used datasets and cost less than RotH.
Enhancing Hyperbolic Knowledge Graph Embeddings via Lorentz Transformations (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for knowledge graph embedding rely on tangent approximation and are not fully hyperbolic.
Approach: They propose a fully hyperbolic KGE method that represents entities as points in the Lorentz model and represents relations as the intrinsic transformation.
Outcome: The proposed method captures various types of relations including hierarchical structures.
3D Rotation and Translation for Hyperbolic Knowledge Graph Embedding (2024.eacl-long)

Copied to clipboard

Challenge: Existing knowledge graph embeddings do not capture relation patterns, but they capture symmetry, antisymmetry, inversion, commutative composition, non-commutable composition, hierarchy, and multiplicity.
Approach: They propose a 3D Rotation and Translation in Hyperbolic space model that captures relation patterns simultaneously.
Outcome: The proposed model outperforms state-of-the-art models in terms of accuracy, hierarchy property, and other relation patterns in low-dimensional space, while performing similarly in high-dimensional spaces.
Hyperbolic Hierarchy-Aware Knowledge Graph Embedding for Link Prediction (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge graph embedding methods are built on Euclidean space, which are difficult to handle hierarchical structures.
Approach: They propose a KGE model with extended Poincaré Ball and polar coordinate system to capture hierarchical structures.
Outcome: The proposed model captures hierarchical relationships with extended Poincaré Ball and polar coordinate system in hyperbolic space and achieves state-of-the-art results on part of link prediction tasks.
HyperKGR: Knowledge Graph Reasoning in Hyperbolic Space with Graph Neural Network Encoding Symbolic Path (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for linking knowledge graphs are incomplete and rely on Euclidean embeddings . a hyperbolic GNN framework embeds recursive learning trees in hyperbolical space .
Approach: They propose a hyperbolic GNN framework that embeds recursive learning trees in hyperbolical space and generates query-specific embeddings.
Outcome: The proposed framework outperforms state-of-the-art methods on multiple benchmark datasets.
Towards Understanding the Geometry of Knowledge Graph Embeddings (P18-1)

Copied to clipboard

Challenge: Knowledge Graph (KG) embedding has emerged as a very active area of research over the last few years, resulting in the development of several embeddable methods.
Approach: They propose to use KG embedding methods to represent entities and relations as vectors in a high-dimensional space.
Outcome: The proposed methods represent entities and relations in KGs as vectors in a high-dimensional space.
BiQUE: Biquaternionic Embeddings of Knowledge Graphs (2021.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge graph embeddings rely on geometric operations to model relational patterns such as symmetry and hierarchical semantics.
Approach: They propose a new knowledge graph embedding model that integrates multiple geometric transformations to model multi-relational knowledge graphs.
Outcome: Experiments on five datasets show that BiQUE can model symmetry, inversion, and composition.
Knowledge Graph Embeddings in Geometric Algebras (2020.coling-main)

Copied to clipboard

Challenge: Existing knowledge graph embedding approaches model entities and relations in KGs using real-valued, complex-value, or hypercomplex-value representations.
Approach: They propose a geometric algebra-based KG embedding framework which uses multivector representations and the geometric product to model entities and relations.
Outcome: The proposed framework outperforms state-of-the-art models for link prediction.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations