Retrieval-augmented agents can query external evidence, yet their reliability in multi-step reasoning remains limited: noisy retrieval may derail multi-hop question answering, while outcome-only reinforcement learning provides credit signals that are too coarse to optimize intermediate steps. We propose EvalAct (Evaluate-as-Action), which converts implicit retrieval quality assessment into an explicit action and enforces a coupled Search-to-Evaluate protocol so that each retrieval is immediately followed by a structured evaluation score, yielding process signals aligned with the interaction trajectory. To leverage these signals, we introduce Process-Calibrated Advantage Rescaling (PCAR), a GRPO-based optimization method that rescales advantages at the segment level according to evaluation scores, emphasizing reliable segments while updating uncertain ones conservatively. Experiments on seven open-domain QA benchmarks show that EvalAct achieves the best average accuracy, with the largest gains on multi-hop tasks, and ablations verify that the explicit evaluation loop drives the primary improvements while PCAR provides consistent additional benefits.
Figures & tables
Figure 1: Overview of EvalAct with PCAR. The agent follows a coupled Search → Evaluate protocol, producing segment-wise self-evaluation scores {zi,k} that PCAR uses to rescale GRPO advantages.
Single-Hop QA
Multi-Hop QA
Avg.
Method
NQ
PopQA
TriviaQA
2Wiki
Bamboogle
HotpotQA
MuSiQue
Backbone: Qwen2.5-3B-Instruct
Direct Generation
10.6
10.8
28.8
24.4
2.4
14.9
2.0
13.4
IRCoT
11.1
20.0
31.2
17.1
24.0
16.4
6.7
18.1
Search-o1
23.8
26.2
47.2
21.8
32.0
22.1
5.4
25.5
Naïve RAG
34.8
38.7
54.4
22.6
8.0
25.5
4.7
27.0
Table 1: Main results (EM, %) on seven open-domain QA benchmarks. Bold and underlined values indicate the best and second-best performance, respectively.
Figure 2: Effect of SFT on Format Alignment. The Base model exhibits high tool parsing failure rates.
Model Variant
SFT
RL Paradigm
Avg. EM
1. Base (Instruct)
✗
-
14.2
2. SFT-Only
✓
-
24.8
3. Base + RL (Vanilla)
✗
Standard
33.1
4. SFT + RL (Vanilla)
✓
Standard
33.5
5. Base EvalAct
✗
EvalAct
17.1
6. EvalAct (Ours)
✓
EvalAct
41.0
Table 2: Ablation of training stages and paradigms on multi-hop benchmarks (Avg. EM, %). Vanilla denotes standard RL without the explicit evaluation loop.
Figure 3: Training curves and ablation overview. (a) Training curves of EvalAct with 3B/7B backbones. (b) Model ablation across training variants. (c) Method ablation on removing the evaluation loop or PCAR. (d) Sensitivity to PCAR rescaling intensity.
Method
2Wiki
Bam.
Hotpot
Mus.
Avg.
EvalAct
50.0
48.0
44.3
21.6
41.0
w/o PCAR
48.2
46.2
44.1
20.8
39.8
w/o Eval Loop
41.4
37.2
38.9
16.5
33.5
Table 3: Method ablation on multi-hop benchmarks (EM, %).
Setting
Params
RIR
Avg.
Δ
EvalAct (Low)
0.05/0.25
1.67
39.8
-0.3
EvalAct (Mid)
0.10/0.50
3.0
40.1
-
EvalAct (High)
0.20/1.00
200
39.4
-0.7
Table 4: Parameter ablation on PCAR intensity. RIR is the ratio between max/min multipliers.
Retrieval-Augmented Generation enhances Large Language Models by grounding responses in external knowledge, but multi-hop reasoning remains vulnerable to error propagation, where early retrieval failures confound subsequent steps. Standard outcome-based optimization only rewards the final answer, leaving intermediate retrieval and reasoning errors undetected. While existing process-based methods introduce step-level signals, they still score each step against the final answer, rewarding spurious successes where flawed retrieval coincidentally produces the correct answer. Step-level supervision in RAG requires evaluating both logical validity and evidential grounding at each step. We introduce PRO-STEP: we train a generative PRM that evaluates both dimensions, employ PRM-guided value tree search to construct preference pairs contrasting valid steps against flawed ones, and optimize the policy via step-level Direct Preference Optimization. Experiments on single and multi-hop QA datasets demonstrate that PRO-STEP achieves the best average EM and F1 across five benchmarks. Code, models, and training data are publicly available at https://github.com/keemminnke/PRO-Step.
MinKeon Kim, Namjun Lee, Jaekwang Kim
Department of Applied Artificial Intelligence, Convergence Program for Social Innovation, Sungkyunkwan University, Seoul, South Korea
Reinforcement learning has emerged as an effective paradigm for training large language models to interleave reasoning with search engine calls. However, existing approaches face a fundamental credit assignment problem: methods like Search-R1 assign a single outcome reward to the entire multi-step trajectory, providing no signal about which reasoning or retrieval decisions were responsible for success or failure. Process-reward methods such as StepSearch introduce step-level supervision but still sample complete trajectories independently, so advantage estimates at any given step are contaminated by the randomness of all other steps. We propose SLATE (Step-Level Advantage estimation for Truncated Exploration), which addresses both problems through two complementary ideas. First, truncated step-level sampling generates k continuations from a shared prefix, isolating all variation to a single decision point. We prove this reduces the variance of advantage estimates by up to a factor of T compared to full-trajectory sampling for T-step trajectories, the first formal variance guarantee for step-level RL in retrieval-augmented reasoning. Second, dense, decomposed process rewards separately evaluate reasoning quality, query quality, and answer correctness on a ternary scale via an LLM judge, providing richer supervision than binary outcome signals or heuristic step-level scores. Experiments on seven QA benchmarks show that SLATE consistently outperforms both sparse-reward and process-reward baselines, achieving a 7.0% relative improvement over Search-R1 on the 7B model and 30.7% on the 3B model. Gains are largest on challenging multi-hop tasks, and ablations confirm that truncated sampling and dense rewards provide complementary benefits.
Chris Samarinas, Haw-Shiuan Chang, Hamed Zamani
Center for Intelligent Information Retrieval University of Massachusetts Amherst Amherst, MA, United States
Agentic search systems iteratively interact with retrieval models to answer complex queries. Despite substantial progress, optimizing retrievers for agentic search remains challenging, often requiring heavy co-training or gold-standard annotations that limit real-world applicability. We propose Critic-R, a framework that explicitly closes the feedback loop between the reasoning agent and the retrieval model during both inference and training. Critic-R introduces a critic model that evaluates the agent's introspective reasoning trace after consuming retrieved evidence to determine whether the retrieved context sufficiently supports the next reasoning step. Critic-R has two complementary mechanisms: Critic-R-Zero, an inference-time query refinement loop that iteratively rewrites queries and retrieval instructions, and Critic-Embed, an optimization approach for retrieval models that leverages successful and failed refinement trajectories as automatic supervision without requiring manual relevance annotation. We evaluate Critic-R on HotpotQA, 2WikiMultihopQA, MuSiQue, and Bamboogle. Results show that Critic-R significantly improves both retrieval quality and downstream answer accuracy.
Md Zarif Ul Alam, Alireza Salemi, Hamed Zamani
Center for Intelligent Information Retrieval University of Massachusetts Amherst United States