MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion
Qingyang Li, Yanru Zhong, Yuchu Qin
Abstract
In recent years, numerous studies have sought to enhance the capabilities of pretrained language models (PLMs) for Knowledge Graph Completion (KGC) tasks by integrating structural information from knowledge graphs. However, existing approaches have not effectively combined the structural attributes of knowledge graphs with the textual descriptions of entities to generate robust entity encodings. To address this issue, this paper proposes Mo-CoKGC (Momentum Contrast Entity Encoding for Knowledge Graph Completion), which incorporates three primary encoders: the entityrelation encoder, the entity encoder, and the momentum entity encoder. Momentum contrastive learning not only provides more negative samples but also allows for the gradual updating of entity encodings. Consequently, we reintroduce the generated entity encodings into the encoder to incorporate the graph's structural information. Additionally, MoCoKGC enhances the inferential capabilities of the entity-relation encoder through deep prompts of relations. On the standard evaluation metric, Mean Reciprocal Rank (MRR), the MoCoKGC model demonstrates superior performance, achieving a 7.1% improvement on the WN18RR dataset and an 11% improvement on the Wikidata5M dataset, while also surpassing the current best model on the FB15k-237 dataset. Through a series of experiments, this paper thoroughly examines the role and contribution of each component and parameter of the model.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b89680d3-d54b-4834-a999-a482c492a1ecCited by top-tier papers4
- DuetGraph: Coarse-to-Fine Knowledge Graph Reasoning with Dual-Pathway Global-Local FusionJin Li, Zezhong Ding, Xike XieNeurIPS 2025 · 5 citations
- On the Theoretical Limitations of Embedding-based Link PredictionSamy Badreddine, Emile van Krieken, Luciano SerafiniICML 2026
- How Sememic Components Can Benefit Link Prediction for Lexico-Semantic Knowledge Graphs?Hansi Wang, Yue Wang, Qiliang Liang, Yang LiuEMNLP 2025
- SNAPHARD CONTRAST LEARNINGChangpu Meng, Jie Yang, Wanqing Li, Yi GuoICLR 2026
Builds on7
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Structure-Augmented Text Representation Learning for Efficient Knowledge Graph CompletionBo Wang, Tao Shen, Guodong Long, Tianyi Zhou et al.WWW 2021 · 322 citations
- HittER: Hierarchical Transformers for Knowledge Graph EmbeddingsSanxing Chen, Xiaodong Liu, Jianfeng Gao, Jian Jiao et al.EMNLP 2021 · 110 citations
- A*Net: A Scalable Path-based Reasoning Approach for Knowledge GraphsZhaocheng Zhu, Xinyu Yuan, Michael Galkin, Louis-Pascal A. C. Xhonneux et al.NeurIPS 2023 · 103 citations
Related papers
- Improving Knowledge Graph Completion with Structure-Aware Supervised Contrastive LearningJiashi Lin, Lifang Wang, Xinyu Lu, Zhongtian Hu et al.EMNLP 2024 · 5 citations
- Tokenization, Fusion, and Augmentation: Towards Fine-grained Multi-modal Entity RepresentationYichi Zhang, Zhuo Chen, Lingbing Guo, Yajing Xu et al.AAAI 2025 · 25 citations
- Subgraph-Aware Training of Language Models for Knowledge Graph Completion Using Structure-Aware Contrastive LearningYoumin Ko, Hyemin Yang, Taeuk Kim, Hyunjoon KimWWW 2025 · 10 citations
- TGCA-LLM: Time-Aware Graph-Text Contrastive Alignment for Enhancing LLMs in Temporal Knowledge Graph CompletionZexuan Wan, Bo Wang, Kuofei Fang, Bin WuAAAI 2026
- RaSE-KGC: A Relation-Aware Segment Encoding Approach for Knowledge Graph CompletionChenxiao Lin, Ye Luo, Kunhong Liu, Qingqiang WuICDE 2026
