Temporal knowledge graph completion (TKGC) aims to predict the missing links among the entities in a temporal knwoledge graph (TKG). Most previous TKGC methods only consider predicting the missing links among the entities seen in the training set, while they are unable to achieve great performance in link prediction concerning newly-emerged unseen entities. Recently, a new task, i.e., TKG few-shot out-of-graph (OOG) link prediction, is proposed, where TKGC models are required to achieve great link prediction performance concerning newly-emerged entities that only have few-shot observed examples. In this work, we propose a TKGC method FITCARL that combines few-shot learning with reinforcement learning to solve this task. In FITCARL, an agent traverses through the whole TKG to search for the prediction answer. A policy network is designed to guide the search process based on the traversed path. To better address the data scarcity problem in the few-shot setting, we introduce a module that computes the confidence of each candidate action and integrate it into the policy for action selection. We also exploit the entity concept information with a novel concept regularizer to boost model performance. Experimental results show that FITCARL achieves stat-of-the-art performance on TKG few-shot OOG link prediction.
翻译:时间知识图完成(TKGC)旨在预测时间知识图(TKG)中实体之间的缺失链接。大多数先前的TKGC方法仅考虑预测训练集中所见实体之间的缺失链接,而无法在涉及新出现的未见实体的链接预测方面实现出色的性能。最近,提出了一个新的任务,即TKG少样本图外(OOG)链接预测,在这个任务中,要求TKGC模型在涉及只有少量现象例子的新出现实体的链接预测方面实现出色的性能。在此工作中,我们提出了一种名为FITCARL的TKGC方法,将少样本学习与强化学习结合起来来解决这个任务。在FITCARL中,代理通过整个TKG进行遍历,搜索预测答案。设计了一个策略网络来基于遍历的路径来指导搜索过程。为了更好地解决少样本情况下的数据稀缺问题,我们引入了一个计算每个候选动作置信度的模块,并将其集成到策略中进行动作选择。我们还利用一种新颖的概念正则化器来利用实体概念信息,以提高模型性能。实验结果表明,FITCARL在TKG少样本OOG链接预测方面实现了最先进的性能。