Asymmetric Proximal Policy Optimization: mini-critics boost LLM reasoning
Jiashun Liu, Johan Obando-Ceron, Han Lu, Yancheng He, Weixun Wang, Wenbo Su, Bo Zheng, Pablo Samuel Castro, Aaron Courville, Ling Pan
TL;DR
This work tackles the critic bottleneck in RL4LLMs by reintroducing lightweight, diverse mini-critics that guide a large actor. It introduces Asymmetric Proximal Policy Optimization (AsyPPO), which trains two mini-critics on disjoint prompt shards to provide calibrated value estimates, and leverages inter-critic uncertainty to refine the policy through advantage masking and entropy filtering. The approach yields robust, data-efficient learning, with substantial performance gains over PPO-based baselines on open-source math benchmarks using as few as 5,000 samples, and it reduces memory and computation relative to symmetric PPO. The findings highlight the value of architectural innovations—specifically asymmetric critic design and uncertainty-aware loss shaping—as a practical path to scalable RL4LLM training.
Abstract
Most recent RL for LLMs (RL4LLM) methods avoid explicit critics, replacing them with average advantage baselines. This shift is largely pragmatic: conventional value functions are computationally expensive to train at LLM scale and often fail under sparse rewards and long reasoning horizons. We revisit this bottleneck from an architectural perspective and introduce Asymmetric Proximal Policy Optimization (AsyPPO), a simple and scalable framework that restores the critics role while remaining efficient in large-model settings. AsyPPO employs a set of lightweight mini-critics, each trained on disjoint prompt shards. This design encourages diversity while preserving calibration, reducing value-estimation bias. Beyond robust estimation, AsyPPO leverages inter-critic uncertainty to refine the policy update: (i) masking advantages in states where critics agree and gradients add little learning signal, and (ii) filtering high-divergence states from entropy regularization, suppressing spurious exploration. After training on open-source data with only 5,000 samples, AsyPPO consistently improves learning stability and performance across multiple benchmarks over strong baselines, such as GRPO, achieving performance gains of more than six percent on Qwen3-4b-Base and about three percent on Qwen3-8b-Base and Qwen3-14b-Base over classic PPO, without additional tricks. These results highlight the importance of architectural innovations for scalable, efficient algorithms.
