Skip to content
Book Open access

Towards Adaptive and Retriever-friendly Retrieval-augmented Generation via Reinforcement Learning

Jul 2026 · International Conference on the Theory of Information Retrieval · 0 citations · 48 references
Computer Science

TL;DR

ARF-RAG is proposed, an Adaptive Retriever-Friendly Retriever-Friendly Retrieval-Augmented Generation framework that adopts a role-unified mechanism, in which a single LLM simultaneously performs all retrieval-related and generation actions, including retrieval decision-making, query generation, and answer generation, enabling coherent optimization across all components.

Abstract

Retrieval-augmented Generation (RAG) has emerged as an effective paradigm for enhancing large language models (LLMs) with external knowledge, delivering substantial performance gains without costly parameter updates, particularly in low-resource settings. However, existing RAG systems still face several open challenges. Many approaches rely on static or heuristic retrieval strategies, limiting their ability to adapt retrieval strategies to different tasks with different reasoning requirements. Some methods build RAG systems based on independently optimized components, making joint optimization across all components infeasible. Moreover, empirical evidence shows that stronger retrievers do not necessarily lead to better end-to-end RAG performance, revealing a misalignment between retrieval quality and generation effectiveness and leaving considerable room for improvement in how retrieval is integrated into the RAG pipeline. Motivated by these challenges, we propose ARF-RAG, an Adaptive Retriever-Friendly Retrieval-Augmented Generation framework. ARF-RAG dynamically determines when to retrieve and further generates retriever-friendly queries that faithfully reflect the generator's current information needs while being optimized for the behavior of the given retriever. ARF-RAG adopts a role-unified mechanism, in which a single LLM simultaneously performs all retrieval-related and generation actions, including retrieval decision-making, query generation, and answer generation, enabling coherent optimization across all components. To effectively align the retriever and generator, we formulate RAG as a unified reinforcement learning (RL) problem. We design comprehensive reward functions that jointly account for answer correctness, retrieval effectiveness, and retrieval cost, enabling fine-grained policy optimization via proximal policy optimization (PPO). Extensive experiments. The codebase for reproducing the proposed framework is publicly available at: https://github.com/ii-research/ARF-RAG on three question-answering benchmarks demonstrate that ARF-RAG consistently outperforms strong non-RL and RL-based baselines on both simple and complex QA tasks. Further analyses show that ARF-RAG adaptively learns when to retrieve based on question complexity and generates more effective, retriever-aligned queries that resolve what to retrieve, highlighting the advantages of unified RL optimization for building robust and efficient RAG systems.

Read PDF

Similar papers

#large language models Review Open access Sep 2026

Advances in Reinforcement Learning for Retrieval-Augmented Generation in Large Language Model

The research findings show that RL has gradually expanded from simply improving the accuracy of the final answer to optimizing queries, multi-round search, process decision-making and trustworthy screening, providing new ideas for enhancing the active retrieval ability of RAG and improving the credibility of informatio...

Zun-Long Hong · 0 citations
Book Open access Jul 2026

Incentivizing Retrieval-Augmented Generation via Inner Adaptive Context Selection

InnerRAG is a novel paradigm that empowers LLMs to autonomously select relevant context during generation by endowing the model to accurately identify the documents that are most helpful for generation from long contexts, leading to substantial improvements in generation quality while maintaining computational efficien...

Chenxu Cui, Lin Shen, Haihui Fan et al. · 0 citations
Conference Jul 2026

AdaRAG: Budget-Aware Adaptive Retrieval-Augmented Generation via Hierarchical Reinforcement Learning

Multi-turn retrieval-augmented generation (RAG) improves question answering by decomposing evidence seeking into iterative retrieval and reasoning steps. Existing multi-turn RAG methods usually optimize when and how to retrieve while fixing the number of retrieved documents per step. However, we discovered that this fi...

Jia-Nan Sun, Miao Zhang, Chen Chen et al. · 0 citations
#reinforcement learning Book Open access Aug 2026

NaviRAG: Learning to Navigate Knowledge Graphs for Retrieval-Augmented Generation

Retrieval-Augmented Generation (RAG) has become a fundamental paradigm for enhancing Large Language Models (LLMs) with external knowledge. However, while recent structure-augmented approaches organize documents into graphs to improve information access, their retrieval strategies remain largely static, relying on simil...

Jinghong Lei, Wang Kun, Zhigang Chen et al. · 0 citations
Open access 2026

SAC-RAG: Semantic Adaptive Context Compression for Retrieval-Augmented Generation

Experimental results show that SAC-RAG reduces token consumption by 38%–58% at the cost of only a 1–2 percentage point EM drop, with EM actually improving after compression for reasoning-type questions, achieving the optimal quality–efficiency trade-off in terms of token consumption.

Deyu Zhang, Hongqiang Yu, Jinze Huo et al. · 0 citations
Conference 2026

DARE-RAG: Difficulty-Aware Retrieval Expansion for Retrieval-Augmented Generation

DARE-RAG is proposed, an adaptive retrieval framework that activates LLM-based query expansion only for retrieval-challenging queries, and formulates expansion activation as a lightweight binary classification problem using probe retrieval signals, including score margin, variance, entropy, query length, and lexical sp...

Li-Xiang Zhu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.