RPO: Retrieval Preference Optimization for Robust Retrieval-Augmented Generation
Shi-Qi Yan, Quan Liu, Zhen-Hua Ling
TL;DR
This work tackles knowledge conflicts in retrieval-augmented generation by integrating retrieval relevance into the training objective. The authors propose Retrieval Preference Optimization (RPO), a retrieval-aware alignment that combines generation and retrieval evaluation through a specialized reward model and a two-stage training pipeline (SFT followed by RPO). They demonstrate that RPO yields 4–10% accuracy gains across four benchmarks (PopQA, Natural Questions, TriviaQA, RGB) and offers robustness to low-quality retrieval and reduced inference overhead through Integrated-Eval. The approach provides a practical path toward more reliable RAG systems by explicitly modeling retrieval quality within the learning objective, with strong empirical evidence and ablation-supported insights on its components.
Abstract
While Retrieval-Augmented Generation (RAG) has exhibited promise in utilizing external knowledge, its generation process heavily depends on the quality and accuracy of the retrieved context. Large language models (LLMs) struggle to evaluate the correctness of non-parametric knowledge retrieved externally when it differs from internal memorization, leading to knowledge conflicts during response generation. To this end, we introduce the Retrieval Preference Optimization (RPO), a lightweight and effective alignment method to adaptively leverage multi-source knowledge based on retrieval relevance. An implicit representation of retrieval relevance is derived and incorporated into the reward model to integrate retrieval evaluation and response generation into a single model, solving the problem that previous methods necessitate the additional procedure to assess the retrieval quality. Notably, RPO is the only RAG-dedicated alignment approach that quantifies the awareness of retrieval relevance in training, overcoming mathematical obstacles. Experiments on four datasets demonstrate that RPO outperforms RAG by 4-10% in accuracy without any extra component, exhibiting its robust generalization.
