Tree-of-Traversals: A Zero-Shot Reasoning Algorithm for Augmenting Black-box Language Models with Knowledge Graphs
원문 초록
Knowledge graphs (KGs) complement Large Language Models (LLMs) by providing reliable, structured, domain-specific, and up-to-date external knowledge. However, KGs and LLMs are often developed separately and must be integrated after training. We introduce Tree-of-Traversals, a novel zero-shot reasoning algorithm that enables augmentation of black-box LLMs with one or more KGs. The algorithm equips a LLM with actions for interfacing a KG and enables the LLM to perform tree search over possible thoughts and actions to find high confidence reasoning paths. We evaluate on two popular benchmark datasets. Our results show that Tree-of-Traversals significantly improves performance on question answering and KG question answering tasks. Code is available at \url{https://github.com/amazon-science/tree-of-traversals}
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering
Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities
Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering
DGRAG: Distributed Graph-based Retrieval-Augmented Generation in Edge-Cloud Systems
DO-RAG: A Domain-Specific QA Framework Using Knowledge Graph-Enhanced Retrieval-Augmented Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.