From Correctness to Utility: Gain-Based Prefix Evaluation for LLM Reasoning
Abstract
Prefix utility modeling improves large language model problem-solving by evaluating complete trajectories and partial reasoning paths through a learned prefix gain metric.
Reasoning prefixes shape the future trajectory of LLM problem solving, yet existing process reward models usually evaluate them through local step correctness. We argue that correctness is a useful but indirect proxy for the effect we ultimately care about: whether a prefix increases the probability of successful completion. We define this effect as prefix gain, the solve-rate improvement induced by conditioning lightweight student model group on a prefix, and use it to train a Prefix Utility Model (PUM) with a simple pairwise ranking objective. PUM learns outcome-grounded prefix utility and can score both complete trajectories and partial reasoning prefixes. Across Best-of-N selection, beam search, and reinforcement learning on mathematical reasoning, PUM provides a strong prefix-level supervision signal, especially when candidate pools are large, search budgets increase, or rule-based rewards are sparse. We release all data, models, and code at https://zhiqix.github.io/pum-project-page.
Models citing this paper 1
Datasets citing this paper 1
zhiqix/PUM-MATH
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper