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

基于双智能体的知识图谱推理学习行走

Learning to Walk with Dual Agents for Knowledge Graph Reasoning

Rutgers University(罗格斯大学);Hong Kong University of Science and Technology (HKUST)(香港科技大学)

Denghui Zhang, Zixuan Yuan, Hao Liu, Xiaodong Lin, Hui Xiong

摘要:

基于强化学习(RL)的图行走在引导智能体通过探索多跳关系路径在不完整的知识图谱(KG)上自动完成各种推理任务方面取得了巨大成功。然而,现有的多跳推理方法只适用于较短的推理路径,并且随着路径长度的增加,往往会错过目标实体。这对于现实世界中的许多推理任务来说是不可取的,其中连接源实体和目标实体的短路径在不完整的KG中不可用,因此推理性能急剧下降,除非智能体能够从较长的路径中找出更多的线索。为了解决上述挑战,在本文中,我们提出了一个双智能体强化学习框架,该框架训练两个智能体(GIANT和DWARF)联合遍历KG并协作搜索答案。我们的方法通过分配一个代理(GIANT)快速搜索集群级路径并为另一个代理(DWARF)提供阶段提示来解决长路径中的推理挑战。最后,在几个KG推理基准上的实验结果表明,该方法能够更准确、更高效地搜索答案,并且在长路径查询上的性能明显优于现有的基于RL的方法.

英文摘要:

Graph walking based on reinforcement learning (RL) has shown great success in navigating an agent to automatically complete various reasoning tasks over an incomplete knowledge graph (KG) by exploring multi-hop relational paths. However, existing multi-hop reasoning approaches only work well on short reasoning paths and tend to miss the target entity with the increasing path length. This is undesirable for many reason-ing tasks in real-world scenarios, where short paths connecting the source and target entities are not available in incomplete KGs, and thus the reasoning performances drop drastically unless the agent is able to seek out more clues from longer paths. To address the above challenge, in this paper, we propose a dual-agent reinforcement learning framework, which trains two agents (GIANT and DWARF) to walk over a KG jointly and search for the answer collaboratively. Our approach tackles the reasoning challenge in long paths by assigning one of the agents (GIANT) searching on cluster-level paths quickly and providing stage-wise hints for another agent (DWARF). Finally, experimental results on several KG reasoning benchmarks show that our approach can search answers more accurately and efficiently, and outperforms existing RL-based methods for long path queries by a large margin.

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

↑