Challenge: Knowledge Graph Completion (KGC) is a task that infers unseen relationships between entities . traditional embedding-based methods infer missing links using only training data . a pre-trained language model (PLM)-based KGC may be ineffective in practical applications .
Approach: They propose to use knowledge Graph Completion (KGC) to infer unseen relationships . traditional embedding-based KGC methods infer missing links only from training data . they argue that pre-trained language models acquire inference abilities through pre-training .
Outcome: The proposed method improves performance even though it does not use memorized knowledge.

Similar Papers

Knowledge Context Modeling with Pre-trained Language Models for Contrastive Knowledge Graph Completion (2024.findings-acl)

Copied to clipboard

Challenge: Text-based knowledge graph completion methods neglect knowledge contexts in inferring process.
Approach: They propose a framework which models the knowledge context as additional prompts with pre-trained language models for knowledge graph completion.
Outcome: The proposed framework achieves state-of-the-art on FB15k-237, WN18RR and Wikidata5M datasets.
Do Pre-trained Models Benefit Knowledge Graph Completion? A Reliable Evaluation and a Reasonable Approach (2022.findings-acl)

Copied to clipboard

Challenge: Pre-trained language models capture factual knowledge from massive texts . but they are still quite behind the SOTA KGC models in terms of performance .
Approach: They propose to use open-world assumption to evaluate PLM-based knowledge graph completion models . they propose to convert each triple and its support information into natural prompt sentences .
Outcome: The proposed model is more accurate under the open-world assumption (OWA) this setting manual checks the correctness of knowledge that is not in KGs.
Prior Relational Schema Assists Effective Contrastive Learning for Inductive Knowledge Graph Completion (2024.lrec-main)

Copied to clipboard

Challenge: Existing knowledge graphs lack robustness and incompleteness to provide link prediction.
Approach: They propose to capture prior schema-level interactions related to relations by leveraging entity type information and introduce schema-guided negatives to bolster the efficiency of normal contrastive representation learning.
Outcome: The proposed method achieves state-of-the-art performance on multiple established metrics across multiple datasets for link prediction.
SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models (2022.acl-long)

Copied to clipboard

Challenge: Text-based methods lag behind graph embedding-based approaches for knowledge graph completion (KGC)
Approach: They propose three types of negatives to improve contrastive learning to improve learning efficiency.
Outcome: The proposed model outperforms embedding-based methods on several benchmark datasets.
Multi-perspective Improvement of Knowledge Graph Completion with Large Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Knowledge graph completion (KGC) is a widely used method to tackle incompleteness in knowledge graphs (KGs).
Approach: They propose a general framework to compensate for the deficiency of contextualized knowledge by querying large language models from various perspectives.
Outcome: The proposed framework improves knowledge graph completion (KGC) by querying large language models from various perspectives.
Multi-Task Learning for Knowledge Graph Completion with Pre-trained Language Models (2020.coling-main)

Copied to clipboard

Challenge: Existing knowledge graph completion methods are lacking in ranking metrics such as Hits@k . despite the high performance, the proposed method is still behind state-of-the-art models.
Approach: They propose a multi-task learning method that integrates relational and relevance ranking tasks with target link prediction to improve ranking performance.
Outcome: The proposed method improves ranking performance but still behind state-of-the-art models in Hits@k and Mean Rank metrics.
A Re-evaluation of Knowledge Graph Completion Methods (2020.acl-main)

Copied to clipboard

Challenge: Knowledge Graph Completion (KGC) aims at automatically predicting missing links for large-scale knowledge graphs.
Approach: They propose a protocol to evaluate KGC methods that is robust to handle bias in the model, which can substantially affect the final results.
Outcome: The proposed evaluation protocol is robust to handle bias in the model, which can substantially affect the final results.
Path-enhanced Pre-trained Language Model for Knowledge Graph Completion (2025.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models have achieved remarkable knowledge graph completion (KGC) success.
Approach: They propose a path-enhanced pre-trained language model-based knowledge graph completion method which uses multi-view generation to infer missing facts in triple-level and path-level simultaneously.
Outcome: The proposed method significantly improves the performance of the knowledge graph completion task.
KG-TRICK: Unifying Textual and Relational Information Completion of Knowledge for Multilingual Knowledge Graphs (2025.coling-main)

Copied to clipboard

Challenge: Existing studies have shown that combining information from KGs in different languages aids knowledge Graph Completion and Knowledge Graph Enhancement.
Approach: They propose a sequence-to-sequence framework that unifies tasks of textual and relational information completion for multilingual knowledge graphs.
Outcome: The proposed framework unifies tasks of KGC and KGE into a single framework.
Multilingual Knowledge Graph Completion with Language-Sensitive Multi-Graph Attention (2023.acl-long)

Copied to clipboard

Challenge: Existing approaches to multilingual knowledge graph completion have two drawbacks: alignment dependency and training inefficiency.
Approach: They propose a multilingual knowledge graph completion framework with language-sensitive multi-graph attention to predict missing links on all given KGs.
Outcome: The proposed model improves on the DBP-5L and E-PKG datasets.

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