Self-Supervised Hyperboloid Representations from Logical Queries over
Knowledge Graphs
- URL: http://arxiv.org/abs/2012.13023v2
- Date: Mon, 15 Feb 2021 02:17:31 GMT
- Title: Self-Supervised Hyperboloid Representations from Logical Queries over
Knowledge Graphs
- Authors: Nurendra Choudhary, Nikhil Rao, Sumeet Katariya, Karthik Subbian,
Chandan K. Reddy
- Abstract summary: Knowledge Graphs (KGs) are ubiquitous structures for information storage in several real-world applications such as web search, e-commerce, social networks, and biology.
We formulate representation learning as a self-supervised logical query reasoning problem that utilizes translation, intersection and union queries over KGs.
We propose Hyperboloid Embeddings (HypE), a novel self-supervised dynamic reasoning framework, that utilizes positive first-order existential queries on a KG to learn representations of its entities and relations as hyperboloids in a Poincar'e ball.
- Score: 18.92547855877845
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Knowledge Graphs (KGs) are ubiquitous structures for information storagein
several real-world applications such as web search, e-commerce, social
networks, and biology. Querying KGs remains a foundational and challenging
problem due to their size and complexity. Promising approaches to tackle this
problem include embedding the KG units (e.g., entities and relations) in a
Euclidean space such that the query embedding contains the information relevant
to its results. These approaches, however, fail to capture the hierarchical
nature and semantic information of the entities present in the graph.
Additionally, most of these approaches only utilize multi-hop queries (that can
be modeled by simple translation operations) to learn embeddings and ignore
more complex operations such as intersection and union of simpler queries. To
tackle such complex operations, in this paper, we formulate KG representation
learning as a self-supervised logical query reasoning problem that utilizes
translation, intersection and union queries over KGs. We propose Hyperboloid
Embeddings (HypE), a novel self-supervised dynamic reasoning framework, that
utilizes positive first-order existential queries on a KG to learn
representations of its entities and relations as hyperboloids in a Poincar\'e
ball. HypE models the positive first-order queries as geometrical translation,
intersection, and union. For the problem of KG reasoning in real-world
datasets, the proposed HypE model significantly outperforms the state-of-the
art results. We also apply HypE to an anomaly detection task on a popular
e-commerce website product taxonomy as well as hierarchically organized web
articles and demonstrate significant performance improvements compared to
existing baseline methods. Finally, we also visualize the learned HypE
embeddings in a Poincar\'e ball to clearly interpret and comprehend the
representation space.
Related papers
- A Prompt-Based Knowledge Graph Foundation Model for Universal In-Context Reasoning [17.676185326247946]
We propose a prompt-based KG foundation model via in-context learning, namely KG-ICL, to achieve a universal reasoning ability.
To encode prompt graphs with the generalization ability to unseen entities and relations in queries, we first propose a unified tokenizer.
Then, we propose two message passing neural networks to perform prompt encoding and KG reasoning, respectively.
arXiv Detail & Related papers (2024-10-16T06:47:18Z) - Query Structure Modeling for Inductive Logical Reasoning Over Knowledge
Graphs [67.043747188954]
We propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs.
It encodes linearized query structures and entities using pre-trained language models to find answers.
We conduct experiments on two inductive logical reasoning datasets and three transductive datasets.
arXiv Detail & Related papers (2023-05-23T01:25:29Z) - Complex Logical Reasoning over Knowledge Graphs using Large Language Models [13.594992599230277]
Reasoning over knowledge graphs (KGs) is a challenging task that requires a deep understanding of the relationships between entities.
Current approaches rely on learning geometries to embed entities in vector space for logical query operations.
We propose a novel decoupled approach, Language-guided Abstract Reasoning over Knowledge graphs (LARK), that formulates complex KG reasoning as a combination of contextual KG search and logical query reasoning.
arXiv Detail & Related papers (2023-05-02T02:21:49Z) - Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs [29.47155614953955]
We develop a novel query embedding method, RoConE, that defines query regions as geometric cones and algebraic query operators by rotations in complex space.
Our experimental results on several benchmark datasets confirm the advantage of relational patterns for enhancing logical query answering task.
arXiv Detail & Related papers (2023-03-21T13:59:15Z) - Logical Message Passing Networks with One-hop Inference on Atomic
Formulas [57.47174363091452]
We propose a framework for complex query answering that decomposes the Knowledge Graph embeddings from neural set operators.
On top of the query graph, we propose the Logical Message Passing Neural Network (LMPNN) that connects the local one-hop inferences on atomic formulas to the global logical reasoning.
Our approach yields the new state-of-the-art neural CQA model.
arXiv Detail & Related papers (2023-01-21T02:34:06Z) - UniKGQA: Unified Retrieval and Reasoning for Solving Multi-hop Question
Answering Over Knowledge Graph [89.98762327725112]
Multi-hop Question Answering over Knowledge Graph(KGQA) aims to find the answer entities that are multiple hops away from the topic entities mentioned in a natural language question.
We propose UniKGQA, a novel approach for multi-hop KGQA task, by unifying retrieval and reasoning in both model architecture and parameter learning.
arXiv Detail & Related papers (2022-12-02T04:08:09Z) - Reasoning over Multi-view Knowledge Graphs [59.99051368907095]
ROMA is a novel framework for answering logical queries over multi-view KGs.
It scales up to KGs of large sizes (e.g., millions of facts) and fine-granular views.
It generalizes to query structures and KG views that are unobserved during training.
arXiv Detail & Related papers (2022-09-27T21:32:20Z) - Explainable Sparse Knowledge Graph Completion via High-order Graph
Reasoning Network [111.67744771462873]
This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs)
It combines high-order reasoning into a graph convolutional network, namely HoGRN.
It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
arXiv Detail & Related papers (2022-07-14T10:16:56Z) - Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces.
Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
arXiv Detail & Related papers (2022-06-24T08:33:43Z) - Query Embedding on Hyper-relational Knowledge Graphs [0.4779196219827507]
Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs.
We extend the multi-hop reasoning problem to hyper-relational KGs allowing to tackle this new type of complex queries.
arXiv Detail & Related papers (2021-06-15T14:08:50Z) - Knowledge Graphs and Knowledge Networks: The Story in Brief [0.1933681537640272]
Knowledge Graphs (KGs) represent real-world noisy raw information in a structured form, capturing relationships between entities.
For dynamic real-world applications such as social networks, recommender systems, computational biology, relational knowledge representation has emerged as a challenging research problem.
This article attempts to summarize the journey of KG for AI.
arXiv Detail & Related papers (2020-03-07T18:09:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.