arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2407.05705cs.AI
收藏

通过增量 LoRA 实现快速且持续的知识图谱嵌入

Fast and Continual Knowledge Graph Embedding via Incremental LoRA

School of Computer Science and Engineering, Southeast University(东南大学计算机科学与工程学院);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);College of Software Engineering, Southeast University(东南大学软件学院)

Jiajun Liu, Wenjun Ke, Peng Wang, Jiahao Wang, Jinhua Gao, Ziyu Shang, Guozheng Li, Zijie Xu, Ke Ji, Yining Li

AI总结:

针对持续知识图谱嵌入中高效学习新知识的问题,提出增量 LoRA 框架,通过层隔离分配与自适应秩分配降低训练成本并保持性能。

摘要:

持续知识图谱嵌入(CKGE)旨在高效学习新知识,同时保留旧知识。主流方法主要关注缓解旧知识的灾难性遗忘,却忽视了新知识出现时的高效学习。然而,在真实场景中,知识图谱(KG)持续增长,这给高效微调 KGE 模型带来了重大挑战。为解决该问题,我们提出了一个快速 CKGE 框架(\model),其中纳入增量低秩适配器(\mec)机制,以在保留旧知识的同时高效获取新知识。具体而言,为缓解灾难性遗忘,\model 基于旧 KG 与新 KG 之间的细粒度影响,将新知识隔离并分配到特定层。随后,为加速微调,\model 设计了高效的 \mec 机制,该机制将特定层嵌入到具有更少训练参数的增量低秩适配器中。此外,\mec 引入自适应秩分配,使 LoRA 能够感知实体的重要性并自适应调整其秩规模。我们在四个公开数据集和两个初始规模更大的新数据集上进行了实验。实验结果表明,在四个公开数据集上,\model 可将训练时间减少 34%-49%,同时仍取得与最先进模型相竞争的链路预测性能(平均 MRR 分数为 21.0%,对比 21.1%)。同时,在两个新构建的数据集上,\model 节省了 51%-68% 的训练时间,并将链路预测性能提升了 1.5%。

英文摘要:

Continual Knowledge Graph Embedding (CKGE) aims to efficiently learn new knowledge and simultaneously preserve old knowledge. Dominant approaches primarily focus on alleviating catastrophic forgetting of old knowledge but neglect efficient learning for the emergence of new knowledge. However, in real-world scenarios, knowledge graphs (KGs) are continuously growing, which brings a significant challenge to fine-tuning KGE models efficiently. To address this issue, we propose a fast CKGE framework (\model), incorporating an incremental low-rank adapter (\mec) mechanism to efficiently acquire new knowledge while preserving old knowledge. Specifically, to mitigate catastrophic forgetting, \model\ isolates and allocates new knowledge to specific layers based on the fine-grained influence between old and new KGs. Subsequently, to accelerate fine-tuning, \model\ devises an efficient \mec\ mechanism, which embeds the specific layers into incremental low-rank adapters with fewer training parameters. Moreover, \mec\ introduces adaptive rank allocation, which makes the LoRA aware of the importance of entities and adjusts its rank scale adaptively. We conduct experiments on four public datasets and two new datasets with a larger initial scale. Experimental results demonstrate that \model\ can reduce training time by 34\%-49\% while still achieving competitive link prediction performance against state-of-the-art models on four public datasets (average MRR score of 21.0\% vs. 21.1\%).Meanwhile, on two newly constructed datasets, \model\ saves 51\%-68\% training time and improves link prediction performance by 1.5\%.

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

↑