ComputingComputer ScienceComputational LinguisticsKnowledge RepresentationNatural Language ProcessingGraph-based LearningInformation ExtractionKnowledge ExtractionKnowledge GraphsKnowledge ModelingLanguage ModelingGraph CompletionKnowledge CompletionKnowledge Graph ReasoningKnowledge Graph RepresentationMean Reciprocal RankNegative SamplingReciprocal RankStructure-based Models
Knowledge Graph Completion (KGC) aims to conduct reasoning on the facts within knowledge graphs and automatically infer missing links. Existing methods can mainly be categorized into structure-based or description-based. Structure-based methods effectively represent relational facts in knowledge graphs using entity embeddings and description-based methods leverage pre-trained language models (PLMs) to understand textual information. In this paper, we propose Momentum Contrast for knowledge graph completion with Structure-Augmented pre-trained language models (MoCoSA), which allows the PLM to perceive the structural information by the adaptable structure encoder. We proposed momentum hard negative and intra-relation negative sampling to improve learning efficiency. Experimental results demonstrate that our approach achieves state-of-the-art performance in terms of mean reciprocal rank (MRR), with improvements of 2.5% on WN18RR and 21% on OpenBG500.
21
Momentum Contrast for Unsupervised Visual Representation Learning
Kaiming He, Haoqi Fan, Yuxin Wu et al. · 2020 · 12K citations
Translating embeddings for modeling multi-relational data
Antoine Bordes, Nicolas Usunier, Jason Weston et al. · 2015 · 5.2K citations · Full text