Pith. sign in

REVIEW 3 cited by

Graph Neural Network Enhanced Retrieval for Question Answering of LLMs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.06572 v2 pith:FBDII5OL submitted 2024-06-03 cs.CL cs.AIcs.IR

classification cs.CLcs.AIcs.IR
keywords passagesretrievalgraphneuralaccuracynetworkrgnn-retachieves
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Retrieval augmented generation has revolutionized large language model (LLM) outputs by providing factual supports. Nevertheless, it struggles to capture all the necessary knowledge for complex reasoning questions. Existing retrieval methods typically divide reference documents into passages, treating them in isolation. These passages, however, are often interrelated, such as passages that are contiguous or share the same keywords. Therefore, it is crucial to recognize such relatedness for enhancing the retrieval process. In this paper, we propose a novel retrieval method, called GNN-Ret, which leverages graph neural networks (GNNs) to enhance retrieval by exploiting the relatedness between passages. Specifically, we first construct a graph of passages by connecting passages that are structure-related or keyword-related. A graph neural network (GNN) is then leveraged to exploit the relationships between passages and improve the retrieval of supporting passages. Furthermore, we extend our method to handle multi-hop reasoning questions using a recurrent graph neural network (RGNN), named RGNN-Ret. At each step, RGNN-Ret integrates the graphs of passages from previous steps, thereby enhancing the retrieval of supporting passages. Extensive experiments on benchmark datasets demonstrate that GNN-Ret achieves higher accuracy for question answering with a single query of LLMs than strong baselines that require multiple queries, and RGNN-Ret further improves accuracy and achieves state-of-the-art performance, with up to 10.4% accuracy improvement on the 2WikiMQA dataset.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PG-Agent: An Agent Powered by Page Graph

    cs.AI 2025-08 conditional novelty 6.0 of 10

    An MLLM GUI agent that stores past episodes as a page graph and retrieves action guidelines from it improves step success on three benchmarks.

  2. XGraphRAG: Interactive Visual Analysis for Graph-based Retrieval-Augmented Generation

    cs.IR 2025-06 conditional novelty 6.0 of 10

    A visual analytics framework helps GraphRAG developers trace suspicious retrievals through graph construction and LLM invocation stages, with a user study suggesting faster, more accurate failure diagnosis than an exi...

  3. Beyond Independent Passages: Adaptive Passage Combination Retrieval for Retrieval Augmented Open-Domain Question Answering

    cs.CL 2025-07 conditional novelty 5.0 of 10

    AdaPCR jointly retrieves and reranks passage pairs for open-domain QA, showing small EM/F1 gains over an in-context retrieval baseline, mostly on multi-hop HotpotQA.

Pith tools