Inducing Process Supervision from Outcome-Only Reinforcement Learning
cs.LG, cs.AI
Submitted: 2026-09-29
Updated: 2026-09-29
Code: https://github.com/RUCBM/TIPS
License: http://creativecommons.org/licenses/by/4.0/
The gist: Process reward models (PRMs) have become a key component for LLMs, as their step-level feedback supports both post-training and test-time reasoning.
Terminology
Abstract
Process reward models (PRMs) have become a key component for LLMs, as their step-level feedback supports both post-training and test-time reasoning. However, training strong PRMs remains costly: human step annotation is difficult to scale, while Monte Carlo estimation is computationally expensive and can drift from the intrinsic correctness of steps. To get effective PRMs at low cost, we introduce TIPS (Thinking-Induced Process Supervision), an outcome-only reinforcement learning (RL) framework for training generative PRMs. In TIPS, the model generates a chain-of-thought (CoT) followed by step-level labels and an outcome label. The reward depends solely on whether the predicted outcome matches the ground truth, and the resulting group-relative advantage is used to optimize the entire generated response. Intuitively, when checking intermediate steps helps determine the outcome, more accurate checks can lead to better outcome judgments and higher rewards. Outcome-only RL can therefore reinforce step-level verification without explicit process supervision. We validate the effectiveness of TIPS across math and agent benchmarks and four backbone families. Notably, TIPS-Qwen3-4B-Thinking-2507 reaches 85.2 F1 on ProcessBench with only 3.2K outcome-labeled trajectories, surpassing all evaluated trained PRMs and strong prompt-only judges such as GPT-5.4-Instruct and Claude-4.7-Opus, while still trailing o1-mini. Code and data are available at https://github.com/RUCBM/TIPS.
Sources
- $\tau^2$-Bench: Evaluating Conversational Agents in a Dual-Control Environment
- AgentCPM-Explore: Realizing Long-Horizon Deep Exploration for Edge-Scale Agents
- Training Verifiers to Solve Math Word Problems
- Process Reinforcement through Implicit Rewards
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- RLHF Workflow: From Reward Modeling to Online RLHF
- DARC: Decoupled Asymmetric Reasoning Curriculum for LLM Evolution
- The Llama 3 Herd of Models
- Measuring Mathematical Problem Solving With the MATH Dataset
- Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning
- ToRL: Scaling Tool-Integrated RL
- DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models
- Proximal Policy Optimization Algorithms
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- MiniCPM4: Ultra-Efficient LLMs on End Devices
- OctoThinker: Mid-training Incentivizes Reinforcement Learning Scaling
- J1: Incentivizing Thinking in LLM-as-a-Judge via Reinforcement Learning
- Qwen2.5 Technical Report
- Qwen3 Technical Report
- GenPRM: Scaling Test-Time Compute of Process Reward Models via Generative Reasoning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks