Paper Overview
Field: NLP Authors: Penghui Qi, Xiangxin Zhou, Wee Sun Lee Published: 2025-08-26 arXiv: 2508.17631
Introduction
Group-based reinforcement learning methods such as GRPO for large language models avoid training a critic by sampling multiple responses for each prompt. A reliable critic could instead estimate token-level advantages from one response, but standard critic-based training recipes are often unstable.
Key Contributions
The authors study this instability and develop Best-Practice Critic Optimization (BPCO), a training recipe that combines:
- DPPO (distributed/deterministic policy optimization component)
- Value predictions bounded to the reward range
- Monte Carlo value targets
- Unnormalized policy advantages
- Length-adaptive generalized advantage estimation (GAE)
- BPCO stably improves critic-based baselines
- It matches or exceeds group-based baselines while sampling only one response per prompt, improving sampling efficiency
- arXiv: https://arxiv.org/abs/2508.17631
Because the critic is used only during training, BPCO can also condition it on reward-defining information — such as a reference answer or grading rubric — that is hidden from the policy model.
Results
Controlled experiments isolate the effect of each design choice. On mathematical reasoning tasks across models ranging from 1.5B to 30B-A3B mixture-of-experts:
Links
*Auto-collected on 2026-08-26.*