From Correctness to Utility: Gain-Based Prefix Evaluation for LLM Reasoning

arXiv cs.CL Papers

Summary

This paper introduces Prefix Utility Model (PUM), which evaluates LLM reasoning prefixes based on their utility (improvement in solve rate) rather than local correctness. PUM shows strong performance in mathematical reasoning tasks across selection, search, and reinforcement learning.

arXiv:2606.07190v1 Announce Type: new Abstract: 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.
Original Article
View Cached Full Text

Cached at: 06/08/26, 09:22 AM

# From Correctness to Utility: Gain-Based Prefix Evaluation for LLM Reasoning
Source: [https://arxiv.org/abs/2606.07190](https://arxiv.org/abs/2606.07190)
[View PDF](https://arxiv.org/pdf/2606.07190)

> Abstract: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[this https URL](https://zhiqix.github.io/pum-project-page)\.

## Submission history

From: Yuhang Zhou \[[view email](https://arxiv.org/show-email/f404a999/2606.07190)\] **\[v1\]**Fri, 5 Jun 2026 11:56:50 UTC \(11,463 KB\)

Similar Articles