KG-Agent: An Efficient Autonomous Agent Framework for Complex Reasoning over Knowledge Graph
Jinhao Jiang Affiliation: Gaoling School of Artificial Intelligence, Renmin University of China. Affiliation: Beijing Key Laboratory of Big Data Management and Analysis Methods. Kun Zhou Affiliation: School of Information, Renmin University of China. Affiliation: Beijing Key Laboratory of Big Data Management and Analysis Methods. Wayne Xin Zhao Thanks: Corresponding author. Affiliation: Gaoling School of Artificial Intelligence, Renmin University of China. Affiliation: Beijing Key Laboratory of Big Data Management and Analysis Methods. Yang Song Chen Zhu Affiliation: NLP Center, BOSS Zhipin. Career Science Lab, BOSS Hengshu Zhu Affiliation: NLP Center, BOSS Zhipin. Career Science Lab, BOSS Ji-Rong Wen Affiliation: Gaoling School of Artificial Intelligence, Renmin University of China. Affiliation: School of Information, Renmin University of China. Affiliation: Beijing Key Laboratory of Big Data Management and Analysis Methods.
Abstract
In this paper, we aim to improve the reasoning ability of large language models (LLMs) over knowledge graphs (KGs) to answer complex questions. Inspired by existing methods that design the interaction strategy between LLMs and KG, we propose an autonomous LLM-based agent framework, called KG-Agent, which enables a small LLM to actively make decisions until finishing the reasoning process over KGs. In KG-Agent, we integrate the LLM, multifunctional toolbox, KG-based executor, and knowledge memory, and develop an iteration mechanism that autonomously selects the tool then updates the memory for reasoning over KG. To guarantee the effectiveness, we leverage program language to formulate the multi-hop reasoning process over the KG, and synthesize a code-based instruction dataset to fine-tune the base LLM. Extensive experiments demonstrate that only using 10K samples for tuning LLaMA-7B can outperform state-of-the-art methods using larger LLMs or more data, on both in-domain and out-domain datasets. Our code and data will be publicly released.
原文 arXiv:2402.11163;中英对照 + 大白话阅读 https://aha.fim.ai/paper/2402.11163v1