Annotation-Free Reinforcement Learning Query Rewriting via Verifiable Search Reward

Sungguk Cha, DongWook Kim, Taeseung Hahn, Mintae Kim, Youngsub Han +1 more
7/31/2025
cs.CVcs.CLcs.LG

No confident code implementation found for this paper.

Abstract

Optimizing queries for Retrieval-Augmented Generation (RAG) systems poses a significant challenge, particularly across diverse modal indices. We introduce RL-QR, a novel annotation-free reinforcement learning framework for query rewriting that eliminates the need for costly human-annotated data. By leveraging verifiable search rewards derived from index-aligned synthetic queries, RL-QR overcomes human-annotation dependencies, extending its applicability to various modalities and index domains. Experimental results demonstrate the framework's robustness, achieving substantial retrieval performance gains of up to 3.9$\times$ on lexical retrievers and 3.5$\times$ on semantic retrievers on the MTEB VIDORE V2 benchmark for unstructured visual documents, along with consistent 5\% to 10\% improvements on MS MARCO v2.1 and internal industrial datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cha2025annotationfree,
  title  = {Annotation-Free Reinforcement Learning Query Rewriting via Verifiable Search Reward},
  author = {Sungguk Cha and DongWook Kim and Taeseung Hahn and Mintae Kim and Youngsub Han and Byoung-Ki Jeon},
  year   = {2025},
  eprint = {2507.23242},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.23242v2}
}

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/2507.23242.svg)](https://codeofpaper.com/paper/2507.23242)

Discussion