Mechanism

Proves that a step-level reward should measure progress (the change in success probability induced by step sks_k) rather than absolute state value: RPAV(sk∣s1:k−1)=Vμ(s1:k−1)+α(Qμ(s1:k−1,sk)−Vμ(s1:k−1))⏟Process Advantage Aμ(s1:k−1,sk)R_{\text{PAV}}(s_k \mid s_{1:k-1}) = V^\mu(s_{1:k-1}) + \alpha \underbrace{\left(Q^\mu(s_{1:k-1}, s_k) - V^\mu(s_{1:k-1})\right)}_{\text{Process Advantage } A^\mu(s_{1:k-1}, s_k)} under a distinct prover policy μ\mu, preventing the policy from stalling on zero-progress tautological steps.

References

  1. Rewarding Progress: Scaling Automated Process Verifiers for LLM Reasoning ↗

    Amrith Setlur, Chirag Nagpal, Adam Fisch, Xinyang Geng, Jacob Eisenstein, Rishabh Agarwal et al. · 2024

    All 9 authors

    Amrith Setlur, Chirag Nagpal, Adam Fisch, Xinyang Geng, Jacob Eisenstein, Rishabh Agarwal, Alekh Agarwal, Jonathan Berant, Aviral Kumar