🤖 AI Summary
Existing RAG methods predominantly rely on single-step retrieval, limiting their capability to handle complex, multi-hop question answering. Meanwhile, mainstream multi-step retrieval approaches typically require fine-tuning small language models (SLMs), incurring substantial computational overhead and lacking compatibility with large language models (LLMs). This paper proposes a lightweight, reinforcement learning–based framework for fine-tuning embedders—without modifying the LLM itself. It jointly optimizes a trainable embedder and a value-function-guided multi-step retrieval policy to enable efficient context expansion. The method supports ultra-long contexts (up to 10M tokens) and achieves state-of-the-art performance on long-context benchmarks including Babilong and RULER. It significantly reduces inference cost, mitigates hallucination, and demonstrates strong generalization and deployment efficiency.
📝 Abstract
Retrieval-Augmented Generation (RAG) methods enhance LLM performance by efficiently filtering relevant context for LLMs, reducing hallucinations and inference cost. However, most existing RAG methods focus on single-step retrieval, which is often insufficient for answering complex questions that require multi-step search. Recently, multi-step retrieval approaches have emerged, typically involving the fine-tuning of small LLMs to perform multi-step retrieval. This type of fine-tuning is highly resource-intensive and does not enable the use of larger LLMs. In this work, we propose Q-RAG, a novel approach that fine-tunes the Embedder model for multi-step retrieval using reinforcement learning (RL). Q-RAG offers a competitive, resource-efficient alternative to existing multi-step retrieval methods for open-domain question answering and achieves state-of-the-art results on the popular long-context benchmarks Babilong and RULER for contexts up to 10M tokens.