Smaller Models, Smarter Rewards: A Two-Sided Approach to Process and Outcome Rewards
Jan Niklas Groeneveld, Xi Qin, Alexander Schaefer, Yaad Oren
TL;DR
This work demonstrates that compact decoder-only Phi-4 models can serve as effective dual-role reward models for code generation, handling both process and outcome evaluations via a regression-based value head. By constructing a carefully sampled dataset of 36 rollouts per APPS problem and training with a sigmoid-valued head, the authors show that small models can reliably distinguish correct vs. incorrect solutions and substantially improve rollout selection when used as a critic. They further show that the reward model can also assess intermediate reasoning steps, providing early reliability signals after about half of the generation. Despite promising results, the study notes significant computational demands, data-balance effects, and distributional considerations that guide future work on scaling and generalization.
Abstract
Generating high-quality code remains a challenge for Large Language Models (LLMs). For the evolution of reasoning models on this task, reward models are a necessary intermediate step. These models judge outcomes or intermediate steps. Decoder-only transformer models can be turned into reward models by introducing a regression layer and supervised fine-tuning. While it is known that reflection capabilities generally increase with the size of a model, we want to investigate whether state-of-the-art small language models like the Phi-4 family can be turned into usable reward models blending the consideration of process rewards and outcome rewards. Targeting this goal, we construct a dataset of code samples with correctness labels derived from the APPS coding challenge benchmark. We then train a value-head model to estimate the success probability of intermediate outputs. Our evaluation shows that small LLMs are capable of serving as effective reward models or code evaluation critics, successfully identifying correct solutions among multiple candidates. Using this critic, we achieve over a 20% improvement in the search capability of the most accurate code out of multiple generations.
