Pith. sign in

REVIEW 1 cited by

Don't Forget to Connect! Improving RAG with Graph-based Reranking

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 2405.18414 v1 pith:HISFQYN6 submitted 2024-05-28 cs.CL cs.AIcs.LGcs.SI

classification cs.CLcs.AIcs.LGcs.SI
keywords documentsconnectionscontextg-raggenerationwheninformationlanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Retrieval Augmented Generation (RAG) has greatly improved the performance of Large Language Model (LLM) responses by grounding generation with context from existing documents. These systems work well when documents are clearly relevant to a question context. But what about when a document has partial information, or less obvious connections to the context? And how should we reason about connections between documents? In this work, we seek to answer these two core questions about RAG generation. We introduce G-RAG, a reranker based on graph neural networks (GNNs) between the retriever and reader in RAG. Our method combines both connections between documents and semantic information (via Abstract Meaning Representation graphs) to provide a context-informed ranker for RAG. G-RAG outperforms state-of-the-art approaches while having smaller computational footprint. Additionally, we assess the performance of PaLM 2 as a reranker and find it to significantly underperform G-RAG. This result emphasizes the importance of reranking for RAG even when using Large Language Models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 7 citations worldwide. Full citation record

  1. A Deep Dive into Retrieval-Augmented Generation for Code Completion: Experience on WeChat

    cs.SE 2025-07 conditional novelty 5.0 of 10

    On WeChat's closed-source codebase, similarity-based RAG with combined BM25 and GTE-Qwen retrieval improves open-source LLM code completion more than identifier-based retrieval, with gains growing for larger models.

Pith tools