arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.14840cs.AIcs.CLcs.LG
收藏

CL4KGE:一种用于知识图谱嵌入的课程学习方法

CL4KGE: A Curriculum Learning Method for Knowledge Graph Embedding

Ant Group(蚂蚁集团)

Yang Liu, Chuan Zhou, Peng Zhang, Yanan Cao, Yongchao Liu, Zhao Li, Hongyang Chen

AI总结:

针对知识图谱嵌入训练中三元组难度难以衡量的问题,本文提出可插拔的课程学习方法 CL4KGE,利用 Z-counts 调度训练并提升多种 KGE 模型性能。

摘要:

知识图谱嵌入(KGE)是一项基础性任务,旨在学习知识图谱(KG)中实体和关系的表示,目标是构建足够全面的表示,以逼近实体之间的逻辑和符号互连。本文中,我们通过理论分析定义了一个度量 Z-counts,用于衡量 KG 中每个三元组(<头实体,关系,尾实体>)的训练难度。基于该度量,我们提出 CL4KGE,这是一种高效的、基于课程学习(Curriculum Learning)的 KGE 训练策略。该方法包含一个难度度量器和一个训练调度器,用于辅助 KGE 模型的训练。我们的方法具有灵活性,可作为插件用于多种 KGE 模型,并且具有适应大多数现有 KG 的额外优势。所提出的方法已在流行的 KGE 模型上进行评估,结果表明其能够增强最先进方法的性能。将 Z-counts 用作度量使得识别 KG 中具有挑战性的三元组成为可能,这有助于设计有效的训练策略。

英文摘要:

Knowledge graph embedding (KGE) constitutes a foundational task, directed towards learning representations for entities and relations within knowledge graphs (KGs), with the objective of crafting representations comprehensive enough to approximate the logical and symbolic interconnections among entities. In this paper, we define a metric Z-counts to measure the difficulty of training each triple ($<$head entity, relation, tail entity$>$) in KGs with theoretical analysis. Based on this metric, we propose \textbf{CL4KGE}, an efficient \textbf{C}urriculum \textbf{L}earning based training strategy for \textbf{KGE}. This method includes a difficulty measurer and a training scheduler that aids in the training of KGE models. Our approach possesses the flexibility to act as a plugin within a wide range of KGE models, with the added advantage of adaptability to the majority of KGs in existence. The proposed method has been evaluated on popular KGE models, and the results demonstrate that it enhances the state-of-the-art methods. The use of Z-counts as a metric has enabled the identification of challenging triples in KGs, which helps in devising effective training strategies.

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

↑