CLIRLGApr 10, 2024

Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs

arXiv:2404.07103v3138 citationsh-index: 28Has CodeACL
Originality Incremental advance
AI Analysis

This work addresses hallucinations in LLMs for knowledge-intensive tasks by leveraging graph-structured data, though it is incremental as it builds on existing retrieval-augmented methods.

The authors tackled the problem of hallucinations in large language models (LLMs) on knowledge-intensive tasks by proposing Graph Chain-of-Thought (Graph-CoT), a framework that augments LLMs by reasoning on text-attributed graphs, and it outperformed baselines on the manually constructed GRBench dataset with 1,740 questions.

Large language models (LLMs), while exhibiting exceptional performance, suffer from hallucinations, especially on knowledge-intensive tasks. Existing works propose to augment LLMs with individual text units retrieved from external knowledge corpora to alleviate the issue. However, in many domains, texts are interconnected (e.g., academic papers in a bibliographic graph are linked by citations and co-authorships) which form a (text-attributed) graph. The knowledge in such graphs is encoded not only in single texts/nodes but also in their associated connections. To facilitate the research of augmenting LLMs with graphs, we manually construct a Graph Reasoning Benchmark dataset called GRBench, containing 1,740 questions that can be answered with the knowledge from 10 domain graphs. Then, we propose a simple and effective framework called Graph Chain-of-thought (Graph-CoT) to augment LLMs with graphs by encouraging LLMs to reason on the graph iteratively. Each Graph-CoT iteration consists of three sub-steps: LLM reasoning, LLM-graph interaction, and graph execution. We conduct systematic experiments with three LLM backbones on GRBench, where Graph-CoT outperforms the baselines consistently. The code is available at https://github.com/PeterGriffinJin/Graph-CoT.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes