Domain-Aware RAG: MoL-Enhanced RL for Efficient Training and Scalable Retrieval

Hao Lin, Peitong Xie, Jingxue Chen, Jie Lin, Qingkun Tang +1 more
9/8/2025
cs.CLcs.IR

No official code found. Best implementation: Jamoremore/Domain-Aware-RAG-MoL-Enhanced-RL-for-Efficient-Training-and-Scalable-Retrieval (0 stars, last commit 2025-08-22).

Abstract

Retrieval-Augmented Generation (RAG) systems rely heavily on the retrieval stage, particularly the coarse-ranking process. Existing coarse-ranking optimization approaches often struggle to balance domain-specific knowledge learning with query enhencement, resulting in suboptimal retrieval performance. To address this challenge, we propose MoLER, a domain-aware RAG method that uses MoL-Enhanced Reinforcement Learning to optimize retrieval. MoLER has a two-stage pipeline: a continual pre-training (CPT) phase using a Mixture of Losses (MoL) to balance domain-specific knowledge with general language capabilities, and a reinforcement learning (RL) phase leveraging Group Relative Policy Optimization (GRPO) to optimize query and passage generation for maximizing document recall. A key innovation is our Multi-query Single-passage Late Fusion (MSLF) strategy, which reduces computational overhead during RL training while maintaining scalable inference via Multi-query Multi-passage Late Fusion (MMLF). Extensive experiments on benchmark datasets show that MoLER achieves state-of-the-art performance, significantly outperforming baseline methods. MoLER bridges the knowledge gap in RAG systems, enabling robust and scalable retrieval in specialized domains.

View on arXivView PDF

Code Implementations(1)

Domain-Aware RAG: MoL-Enhanced RL for Efficient Training and Scalable Retrieval

00Aug 22, 20251 years ago

Similar Papers

Cite this paper

@article{lin2025domainaware,
  title  = {Domain-Aware RAG: MoL-Enhanced RL for Efficient Training and Scalable Retrieval},
  author = {Hao Lin and Peitong Xie and Jingxue Chen and Jie Lin and Qingkun Tang and Qianchun Lu},
  year   = {2025},
  eprint = {2509.06650},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.06650v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.06650.svg)](https://codeofpaper.com/paper/2509.06650)

Discussion