arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.02167cs.CL
收藏

SimKGC:基于预训练语言模型的简单对比知识图谱补全

SimKGC: Simple Contrastive Knowledge Graph Completion with Pre-trained Language Models

Microsoft Research Asia(微软亚洲研究院);Yuanfudao AI Lab(猿辅导AI实验室)

Liang Wang, Wei Zhao, Zhuoyu Wei, Jingming Liu

摘要:

知识图谱补全(KGC)的目的是对已知事实进行推理,并推断出缺失的链接。基于文本的方法,诸如KGBERT(Yao等人,2019)从自然语言描述中学习实体表示,并具有归纳KGC的潜力。然而,基于文本的方法的性能仍然在很大程度上落后于基于图嵌入的方法,如TransE(Bordes等人,2013)和RotatE(Sun等人,2019年b)。在本文中,我们确定的关键问题是有效的对比学习。为了提高学习效率,我们引入了三种类型的否定:批内否定,批前否定和自我否定,它们是硬否定的简单形式。结合InfoNCE损失,我们提出的模型SimKGC可以在几个基准数据集上大大优于基于嵌入的方法。在平均倒数排名(MRR)方面,我们在WN18RR上将最先进的技术提高了+19%,在Wikidata5M的转换设置上提高了+6.8%,在Wikidata5M的归纳设置上提高了+22%。进行彻底的分析,以深入了解每个组成部分。我们的代码可在https://github.com/intfloat/SimKGC上获得。

英文摘要:

Knowledge graph completion (KGC) aims to reason over known facts and infer the missing links. Text-based methods such as KGBERT (Yao et al., 2019) learn entity representations from natural language descriptions, and have the potential for inductive KGC. However, the performance of text-based methods still largely lag behind graph embedding-based methods like TransE (Bordes et al., 2013) and RotatE (Sun et al., 2019b). In this paper, we identify that the key issue is efficient contrastive learning. To improve the learning efficiency, we introduce three types of negatives: in-batch negatives, pre-batch negatives, and self-negatives which act as a simple form of hard negatives. Combined with InfoNCE loss, our proposed model SimKGC can substantially outperform embedding-based methods on several benchmark datasets. In terms of mean reciprocal rank (MRR), we advance the state-of-the-art by +19% on WN18RR, +6.8% on the Wikidata5M transductive setting, and +22% on the Wikidata5M inductive setting. Thorough analyses are conducted to gain insights into each component. Our code is available at https://github.com/intfloat/SimKGC .

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑