P Moth-Retrieval: Graph-Free Multi-Hop Retrieval via Query-Time Orchestration (Beating Graph-Based Systems on HotpotQA) [P]
Summary
Moth-Retrieval presents a graph-free approach to multi-hop retrieval that outperforms graph-based systems on the HotpotQA benchmark.
Similar Articles
Most multi-hop RAG goes stale the moment your data changes, what about a training-free approach that skips the graph rebuild?
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.
We open-sourced a graph-free multi-hop RAG framework — matches Graph-RAG accuracy without the rebuild cost (Apache-2.0)
MOTHRAG is a graph-free multi-hop RAG framework that matches the accuracy of graph-based systems like GraphRAG and HippoRAG on benchmarks, while avoiding costly graph rebuilds by using a dense index and query-time orchestration.
@garrytan: Lots of retrieval systems seem to give you keyword matching and graph retrieval in a raw format This plus graph travers…
Garry Tan highlights a retrieval system that uniquely combines keyword matching, graph traversal, and gap analysis, an approach not seen elsewhere.
Ontology-Guided Evidence Path Inference for Multi-hop Knowledge Graph Question Answering
Proposes OPI, an ontology-guided framework for multi-hop knowledge graph question answering that leverages a relation-centric ontology graph for bidirectional retrieval and iterative refinement, achieving state-of-the-art results on multiple benchmarks.
Retrieval is Cheap, Show Me the Code: Executable Multi-Hop Reasoning for Retrieval-Augmented Generation
This paper introduces PyRAG, a framework that reformulates multi-hop retrieval-augmented generation as program synthesis and execution, using executable Python code to represent reasoning steps and enable deterministic feedback and adaptive retrieval.