Most multi-hop RAG goes stale the moment your data changes, what about a training-free approach that skips the graph rebuild?
Summary
Presents a training-free method for multi-hop retrieval-augmented generation that avoids costly graph rebuilds when underlying data changes, tackling the staleness issue in dynamic environments.
Similar Articles
ContextRAG: Extraction-Free Hierarchical Graph Construction for Retrieval-Augmented Generation
ContextRAG introduces an extraction-free method for constructing hierarchical graph indices for retrieval-augmented generation, using Residual-Quantization K-Means and Formal Concept Analysis to reduce LLM calls and tokens by orders of magnitude while maintaining competitive F1 scores on multi-hop questions.
LightRAG: Simple and Fast Retrieval-Augmented Generation
The article introduces LightRAG, an open-source framework that enhances Retrieval-Augmented Generation by integrating graph structures for improved contextual awareness and efficient information retrieval.
Why Retrieval-Augmented Generation Fails: A Graph Perspective
This paper investigates why Retrieval-Augmented Generation (RAG) systems fail despite having access to correct evidence. Using circuit tracing and attribution graphs, the authors find that correct predictions exhibit deeper reasoning paths and more distributed evidence flow, while failures show shallow and fragmented patterns. They propose a graph-based error detection framework and targeted interventions to improve RAG reliability.
A Unified Framework for Context-Aware and Relation-Aware Graph Retrieval-Augmented Generation
This paper proposes HyGRAG, a hierarchical graph RAG framework that integrates contextual and relational information for multi-hop reasoning, achieving a 9.7% average accuracy improvement over existing methods.
In-Context Optimization for Retrieval-Augmented Generation: A Gradient-Descent Perspective
This paper studies retrieval-augmented generation as an in-context optimization process, showing that linear self-attention can implement gradient descent on a unified RAG objective. It proposes a lightweight method for frozen RAG LLMs that predicts context-conditioned updates, improving performance across multiple QA benchmarks.