Simple Rule Injection for ComplEx Embeddings
- URL: http://arxiv.org/abs/2308.03269v1
- Date: Mon, 7 Aug 2023 03:19:59 GMT
- Title: Simple Rule Injection for ComplEx Embeddings
- Authors: Haodi Ma, Anthony Colas, Yuejie Wang, Ali Sadeghian, Daisy Zhe Wang
- Abstract summary: In this work, we propose InjEx, a mechanism to inject multiple types of rules through simple constraints.
We demonstrate that InjEx infuses interpretable prior knowledge into the embedding space.
Our experimental results reveal that InjEx outperforms both baseline KGC models as well as specialized few-shot models.
- Score: 7.19573352891936
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent works in neural knowledge graph inference attempt to combine logic
rules with knowledge graph embeddings to benefit from prior knowledge. However,
they usually cannot avoid rule grounding, and injecting a diverse set of rules
has still not been thoroughly explored. In this work, we propose InjEx, a
mechanism to inject multiple types of rules through simple constraints, which
capture definite Horn rules. To start, we theoretically prove that InjEx can
inject such rules. Next, to demonstrate that InjEx infuses interpretable prior
knowledge into the embedding space, we evaluate InjEx on both the knowledge
graph completion (KGC) and few-shot knowledge graph completion (FKGC) settings.
Our experimental results reveal that InjEx outperforms both baseline KGC models
as well as specialized few-shot models while maintaining its scalability and
efficiency.
Related papers
- Learning Rules from KGs Guided by Language Models [48.858741745144044]
Rule learning methods can be applied to predict potentially missing facts.
Ranking of rules is especially challenging over highly incomplete or biased KGs.
With the recent rise of Language Models (LMs) several works have claimed that LMs can be used as alternative means for KG completion.
arXiv Detail & Related papers (2024-09-12T09:27:36Z) - Can LLMs Reason with Rules? Logic Scaffolding for Stress-Testing and Improving LLMs [87.34281749422756]
Large language models (LLMs) have achieved impressive human-like performance across various reasoning tasks.
However, their mastery of underlying inferential rules still falls short of human capabilities.
We propose a logic scaffolding inferential rule generation framework, to construct an inferential rule base, ULogic.
arXiv Detail & Related papers (2024-02-18T03:38:51Z) - ChatRule: Mining Logical Rules with Large Language Models for Knowledge
Graph Reasoning [107.61997887260056]
We propose a novel framework, ChatRule, unleashing the power of large language models for mining logical rules over knowledge graphs.
Specifically, the framework is initiated with an LLM-based rule generator, leveraging both the semantic and structural information of KGs.
To refine the generated rules, a rule ranking module estimates the rule quality by incorporating facts from existing KGs.
arXiv Detail & Related papers (2023-09-04T11:38:02Z) - Logical Entity Representation in Knowledge-Graphs for Differentiable
Rule Learning [71.05093203007357]
We propose Logical Entity RePresentation (LERP) to encode contextual information of entities in the knowledge graph.
A LERP is designed as a vector of probabilistic logical functions on the entity's neighboring sub-graph.
Our model outperforms other rule learning methods in knowledge graph completion and is comparable or even superior to state-of-the-art black-box methods.
arXiv Detail & Related papers (2023-05-22T05:59:22Z) - Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph
Completion [69.55700751102376]
Few-shot knowledge graph completion (FKGC) aims to predict missing facts for unseen relations with few-shot associated facts.
Existing FKGC methods are based on metric learning or meta-learning, which often suffer from the out-of-distribution and overfitting problems.
In this paper, we propose a normalizing flow-based neural process for few-shot knowledge graph completion (NP-FKGC)
arXiv Detail & Related papers (2023-04-17T11:42:28Z) - Knowledge Reasoning via Jointly Modeling Knowledge Graphs and Soft Rules [17.301284626706856]
Methods of knowledge graph completion (KGC) can be classified into two major categories: rule-based reasoning and embedding-based reasoning.
We propose a novel method that injects rules and learns representations iteratively to take full advantage of rules and embeddings.
arXiv Detail & Related papers (2023-01-07T05:24:29Z) - RulE: Knowledge Graph Reasoning with Rule Embedding [69.31451649090661]
We propose a principled framework called textbfRulE (stands for Rule Embedding) to leverage logical rules to enhance KG reasoning.
RulE learns rule embeddings from existing triplets and first-order rules by jointly representing textbfentities, textbfrelations and textbflogical rules in a unified embedding space.
Results on multiple benchmarks reveal that our model outperforms the majority of existing embedding-based and rule-based approaches.
arXiv Detail & Related papers (2022-10-24T06:47:13Z) - On the Effectiveness of Knowledge Graph Embeddings: a Rule Mining
Approach [11.556969989963358]
We study the effectiveness of Knowledge Graph Embeddings (KGE) for knowledge graph (KG) completion with rule mining.
More specifically, we mine rules from KGs before and after they have been completed by a KGE to compare possible differences in the rules extracted.
Our experiments indicate that there can be huge differences between the extracted rules, depending on the KGE approach for KG completion.
arXiv Detail & Related papers (2022-06-02T10:57:09Z) - Theoretical Rule-based Knowledge Graph Reasoning by Connectivity
Dependency Discovery [2.945948598480997]
We present a theory for rule-based knowledge graph reasoning, based on which the connectivity dependencies in the graph are captured via multiple rule types.
Results show that our RuleDict model not only provides precise rules to interpret new triples, but also achieves state-of-the-art performances on one benchmark knowledge graph completion task.
arXiv Detail & Related papers (2020-11-12T03:00:20Z) - Towards Learning Instantiated Logical Rules from Knowledge Graphs [20.251630903853016]
We present GPFL, a probabilistic learner rule optimized to mine instantiated first-order logic rules from knowledge graphs.
GPFL utilizes a novel two-stage rule generation mechanism that first generalizes extracted paths into templates that are acyclic abstract rules.
We reveal the presence of overfitting rules, their impact on the predictive performance, and the effectiveness of a simple validation method filtering out overfitting rules.
arXiv Detail & Related papers (2020-03-13T00:32:46Z)
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.