一种用于知识表示学习的对抗性迁移网络
An Adversarial Transfer Network for Knowledge Representation Learning
摘要:
知识表示学习在过去的几年里受到了广泛的关注。现有方法的成功在很大程度上依赖于知识图谱的质量。三胞胎很少的实体往往是学习较少的表达能力。幸运的是,有许多知识图谱是由不同的来源构建的,它们的表示可以包含大量的信息。我们提出了一个对抗性的嵌入传输网络ATransN,它通过对齐的实体集将知识从一个或多个教师知识图谱传输到目标知识图谱,而没有显式的数据泄漏。具体来说,我们加入软约束对齐实体对和邻居现有的知识表示学习方法。为了解决教师和目标知识图谱之间可能存在的分布差异问题,我们引入了对抗性自适应模块。该模块的嵌入式计算评估对齐实体对的嵌入之间的一致性程度。然后,一致性得分被用作软约束的权重。教师知识图谱中的关系和三元组不需要获取,因为我们只利用实体表示。知识图谱完成结果表明,ATransN在三个数据集CN 31、WK 31和DWY 100 k上实现了更好的性能。消融研究表明,ATransN可以在不同的设置带来稳定和一致的改善。结合其他知识图谱嵌入算法的扩展和三个教师图的扩展显示了对抗转移网络的良好推广性。
英文摘要:
Knowledge representation learning has received a lot of attention in the past few years. The success of existing methods heavily relies on the quality of knowledge graphs. The entities with few triplets tend to be learned with less expressive power. Fortunately, there are many knowledge graphs constructed from various sources, the representations of which could contain much information. We propose an adversarial embedding transfer network ATransN, which transfers knowledge from one or more teacher knowledge graphs to a target one through an aligned entity set without explicit data leakage. Specifically, we add soft constraints on aligned entity pairs and neighbours to the existing knowledge representation learning methods. To handle the problem of possible distribution differences between teacher and target knowledge graphs, we introduce an adversarial adaption module. The discriminator of this module evaluates the degree of consistency between the embeddings of an aligned entity pair. The consistency score is then used as the weights of soft constraints. It is not necessary to acquire the relations and triplets in teacher knowledge graphs because we only utilize the entity representations. Knowledge graph completion results show that ATransN achieves better performance against baselines without transfer on three datasets, CN3l, WK3l, and DWY100k. The ablation study demonstrates that ATransN can bring steady and consistent improvement in different settings. The extension of combining other knowledge graph embedding algorithms and the extension with three teacher graphs display the promising generalization of the adversarial transfer network.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。