Knowledge Graph Embedding by Adaptive Limit Scoring Loss Using Dynamic Weighting Strategy (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding models use a loss framework to distinguish between correct and incorrect triplets. |
| Approach: | They propose a loss framework that reweights each triplet to highlight the less-optimized triplets. |
| Outcome: | The proposed method performs on several knowledge graph embedding models, including TransE, TransH and ComplEx. |
Similar Papers
RatE: Relation-Adaptive Translating Embedding for Knowledge Graph Completion (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches for knowledge graph embedding have limitations in complex vector space . embeddability of one-to-many relations is not explicitly alleviated . |
| Approach: | They propose a relation-adaptive translating embedding function that can be extended to complex vector space. |
| Outcome: | The proposed translation function improves expressive power and alleviates embedding ambiguity problem. |
A Mutual Information Perspective on Knowledge Graph Embedding (2025.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques suffer from high intra-group similarity, loss of semantic information, and insufficient inference capability, particularly in complex relation patterns such as 1-N and N-1 relations. |
| Approach: | They propose a knowledge graph embedding framework that leverages mutual information maximization to improve the semantic representation of entities and relations. |
| Outcome: | Extensive experiments on benchmark datasets demonstrate the effectiveness of the proposed method, with consistent performance improvements across various baseline models. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
Improving Knowledge Graph Embedding Using Simple Constraints (P18-1)
Copied to clipboard
| Challenge: | Recent efforts focused on designing more complicated models or incorporating extra information beyond triples. |
| Approach: | They propose to use non-negativity constraints on entity representations and approximate entailment constraints on relation representations to improve KG embedding. |
| Outcome: | The proposed model outperforms baseline models on WordNet, Freebase, and DBpedia. |
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for embedding entities and relations in knowledge graphs are heuristically motivated and theoretical understanding of such embeddables is underdeveloped. |
| Approach: | They extend the random walk model of word embeddings to Knowledge Graph Embeddings (KGEs) they propose a learning objective motivated by the theoretical analysis to learn KGEs from a given knowledge graph. |
| Outcome: | The proposed learning objective is motivated by the theoretical analysis to learn KGEs from a given knowledge graph. |
TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods restrict entities on hyper-ellipsoid surfaces, resulting in suboptimal knowledge graph completion. |
| Approach: | They propose a score function that leverages relation-specific translations between head and tail entities to relax constraints on hyper-ellipsoid surfaces. |
| Outcome: | The proposed method achieves state-of-the-art performance on link prediction and generalizes well to datasets in different domains and scales. |
PairRE: Knowledge Graph Embeddings via Paired Relation Vectors (2021.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods fail to solve two major problems at the same time, leading to unsatisfactory results. |
| Approach: | They propose a model with paired vectors for each relation representation that can be adaptively adjusted to fit for different complex relations. |
| Outcome: | Experiments on two knowledge graph datasets show the proposed model can handle complex relations and encode relation patterns. |
RulE: Knowledge Graph Reasoning with Rule Embedding (2024.findings-acl)
Copied to clipboard
| Challenge: | Knowledge graph reasoning is an important problem for knowledge graphs. |
| Approach: | They propose a framework that leverages logical rules to enhance KG reasoning by learning rule embeddings from existing triplets and first-order rules. |
| Outcome: | The proposed framework outperforms existing embedding-based and rule-based methods on multiple benchmarks. |
KGE-CL: Contrastive Learning of Tensor Decomposition Based Knowledge Graph Embeddings (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods ignore semantic similarity between related entities and entity-relation couples in different triples . |
| Approach: | They propose a contrastive learning framework for tensor decomposition based (TDB) KGE that can shorten the semantic distance of related entities and entity-relation couples in different triples and thus improve the performance of KGE. |
| Outcome: | The proposed method achieves 51.2% MRR, 46.8% Hits@1 on three standard KGE datasets, 37.8% MRR and 28.6% Hits @1 on FB15k-237 datasets and 59.1% MRR . |
Debiasing knowledge graph embeddings (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to train knowledge graph embeddings to be neutral to sensitive attributes such as gender have been shown to increase training time by a factor of eight or more. |
| Approach: | They propose a method where all embeddings are trained to be neutral to sensitive attributes such as gender by default using an adversarial loss. |
| Outcome: | The proposed method reduces training time by eightfold and improves accuracy. |