Skip to content

Learning from What You Retrieve: Online RL Fine-Tuning for Semantic Retrieval

Aug 2026 · 0 citations · 33 references
Computer Science

TL;DR

This work proposes PAO (Positive-Advantage-Only), a selective RL optimization method that selectively applies gradient updates only to retrieved items with positive advantages, effectively pulling query embed- dings toward high-reward regions while preserving global topo- logical stability.

Abstract

In large-scale e-commerce retrieval, dual-encoder retrievers are op- timized for contrastive similarity, whereas downstream rerankers capture finer-grained relevance preferences; this objective mis- match limits end-to-end retrieval quality. Reinforcement Learning offers a way to use reward-model feedback for retriever adaptation, but we observe that standard policy-gradient updates can degrade embedding geometry, especially when the document index must remain frozen due to industrial constraints. To address this, we propose PAO (Positive-Advantage-Only), a selective RL optimization method. Our analysis reveals that in- discriminate penalization of negative samples (pushing away) in a frozen high-dimensional space disrupts pre-trained semantic man- ifolds. PAO selectively applies gradient updates only to retrieved items with positive advantages, effectively pulling query embed- dings toward high-reward regions while preserving global topo- logical stability. Experiments on both a massive industrial dataset and public benchmarks demonstrate that PAO significantly outper- forms standard RL and distillation baselines.

View source

Similar papers

Preprint Aug 2026

Test-Time Optimization of Query Embeddings with Ranking Aware Reward Maximization

Dense retrievers rank documents using vector similarity between a frozen encoder and a precomputed index. While test-time ranking rewards from a reranker or LLM judge can improve results, existing methods discard this signal after a single query. Updating the retriever's weights makes rewards reusable, but this require...

Tianyu Chen, Jia-Xing Wu · 2 citations · ⚡1
#natural language process... Preprint Sep 2026

It Takes Two to Match: Co-Evolving Generative Retriever with Reinforcement Learning

CoGR is introduced, a retrieval framework that instead trains LLMs to directly construct retrieval representations on both query and item sides, and shows stable co-evolution and increasingly aligned query--item keyword spaces over training.

Runpeng Dai, Kai-Li Huang, Chang-Sung Kang et al. · 2 citations
Preprint Aug 2026

SSR-GRPO: Integrating Supervision and Semantic IDs into Reinforcement Learning for Dense Retrieval in E-commerce

This paper proposes Supervised Retrieval-GRPO with Semantic Identifiers (SSR-GRPO), a dual-perspective framework for relevance assessment that leverages both Semantic Identifiers produced by quantization learning and dense representation vectors to generate more unbiased relevance scores.

Guangxin Song, Xingye Fang, Ming-Min Jin et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Efficient GPU Retrieval for Semantic Search

A policy-aligned retrieval framework that improves offline relevance over a matched-capacity baseline, with gains broadly distributed across facet combinations, and serves this framework with a two-stage GPU architecture.

Dhritiman Das, Chujie Zheng, Ronak Kaoshik et al. · 0 citations
Preprint Aug 2026

Navigation-Informed Embeddings: Dense-Retriever Adaptation from Agent Search Traces

Agentic retrieval workflows produce query, retrieval, and stopping traces as a byproduct of answering questions. We study how these traces can adapt a deployed dense retriever to changing workflow distributions without new relevance labels, synthetic queries, or LLM judgments. We introduce Navigation-Informed Embedding...

Shrey B. Shah, Levent Ozgur · 0 citations
Open access Aug 2026

Do Retrieval-Trained Embeddings Help Linear Contextual Bandits?

Text embeddings from retrieval-tuned (dual-encoder) models are increasingly used as context features in contextual bandits for recommendation, on the assumption that an embedding space optimized for inner-product similarity will speed up a linear exploration policy. This study tests that assumption with a controlled, s...

Mustafa Canim · 0 citations

Related blog posts

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