Mechanism

Instead of assigning a single scalar score at the end of a trajectory, assigns a correctness probability pk=P(step sk is valid and on-track∣x,s1:k)∈[0,1]p_k = P(\text{step } s_k \text{ is valid and on-track} \mid x, s_{1:k}) \in [0, 1] at the end of every reasoning step delimiter (e.g., \n\n), aggregating step scores via product ∏kpk\prod_k p_k or minimum min⁡kpk\min_k p_k for Best-of-NN reranking or step-level RL reward shaping.

Practical Notes

Superior to ORM for identifying the exact first bad step in a proof or calculation, though naive step-level RL against a learned neural PRM can trigger severe reward hacking (e.g., repeating trivial tautologies to farm positive step rewards) unless bounded by outcome verification or process advantage (PAV).

References

  1. Solving math word problems with process- and outcome-based feedback ↗

    Jonathan Uesato, Nate Kushman, Ramana Kumar, Francis Song, Noah Siegel, Lisa Wang et al. · 2022

    All 9 authors

    Jonathan Uesato, Nate Kushman, Ramana Kumar, Francis Song, Noah Siegel, Lisa Wang, Antonia Creswell, Geoffrey Irving, Irina Higgins

  2. Let's Verify Step by Step ↗

    Hunter Lightman, Vineet Kosaraju, Yura Burda, Harri Edwards, Bowen Baker, Teddy Lee et al. · 2023

    All 10 authors

    Hunter Lightman, Vineet Kosaraju, Yura Burda, Harri Edwards, Bowen Baker, Teddy Lee, Jan Leike, John Schulman, Ilya Sutskever, Karl Cobbe