PRO-Step: Step-level Process Reward Optimization for Retrieval-Augmented Generation
Abstract
PRO-STEP improves multi-hop retrieval-augmented reasoning by training a process reward model that checks both logic and evidence at each step, then optimizing via step-level preference learning.
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.
Get this paper in your agent:
hf papers read 2609.01658 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 2
MinKeonKim/PRO-STEP-PRM-8B
Datasets citing this paper 2
MinKeonKim/PRO-STEP-PRM-Data
MinKeonKim/PRO-STEP-Preference-Data
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper