Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper addresses the credit-assignment challenge in training retrieval agents by proposing RICE-PO, a critic-free policy optimization framework that localizes learning signals from interactive search behaviors. By converting raw retrieval interactions into direct supervision for latent reasoning steps, the method effectively bypasses unreliable outcome-level rewards to improve agent performance on standard benchmarks like BEIR and BRIGHT. The work advances machine learning techniques specifically designed for complex, iterative language-agent environments where traditional reward modeling fails due to non-observable intermediate states.
Sources coveringarXiv, AWS, Latent Space, SiliconANGLE
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents

arXiv2 min read

arXiv:2605.26352v2 Announce Type: replace Abstract: Retrieval is increasingly moving from one-shot matching toward interactive reasoning, where language agents iteratively inspect evidence, reformulate queries, and search again. Training such agents raises a credit-assignment challenge: executable actions such as queries or summaries can be directly evaluated by the retriever, while latent reasoning steps are not directly observable and only affect future executable actions. This asymmetry makes outcome-level reward assignment unreliable, as the same final reward may credit reasoning steps that did not actually shape retrieval success. We propose RICE-PO, a critic-free policy optimization framework that converts retrieval interactions into localized learning signals. RICE-PO selects high-uncertainty executable actions as anchors, evaluates local counterfactual branches using retrieval metrics, and propagates credit to latent reasoning steps only when reasoning-to-action influence is strong and future residual effects are stable. On BRIGHT and BEIR, RICE-PO consistently outperforms prompt-based agents and group-based RL baselines under the same retriever setting. These results show that the structure of agent-environment interaction itself can provide useful supervision for training reasoning-based retrieval agents.

Abstract:Retrieval is increasingly moving from one-shot matching toward interactive reasoning, where language agents iteratively inspect evidence, reformulate queries, and search again. Training such agents raises a credit-assignment challenge: executable actions such as queries or summaries can be directly evaluated by the retriever, while latent reasoning steps are not directly observable and only affect future executable actions. This asymmetry makes outcome-level reward assignment unreliable, as the same final reward may credit reasoning steps that did not actually shape retrieval success. We propose RICE-PO, a critic-free policy optimization framework that converts retrieval interactions into localized learning signals. RICE-PO selects high-uncertainty executable actions as anchors, evaluates local counterfactual branches using retrieval metrics, and propagates credit to latent reasoning steps only when reasoning-to-action influence is strong and future residual effects are stable. On BRIGHT and BEIR, RICE-PO consistently outperforms prompt-based agents and group-based RL baselines under the same retriever setting. These results show that the structure of agent-environment interaction itself can provide useful supervision for training reasoning-based retrieval agents.

Computation and Language (cs.CL)

arXiv:2605.26352 [cs.CL]

(or arXiv:2605.26352v2 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2605.26352 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 258 words

Related coverage