Listwise Policy Optimization: Group-based RLVR as Target-Projection on the LLM Response Simplex
Authors: name: Yun Qu, name: Qi Wang, name: Yixiu Mao, name: Heming Zou, name: Yuhang Jiang, name: Yingyue Li, name: Wutong Xu, name: Lizhou Cai, name: Weijie Liu, name: Clive Bai, name: Kai Yang, name: Yangkun Chen, name: Saiyong Yang, name: Xiangyang Ji
Organization: Tencent Hunyuan

Reinforcement learning with verifiable rewards (RLVR) has become a standard approach for large language models (LLMs) post-training to incentivize reasoning capacity. Among existing recipes, group-based policy gradient is prevalent, which samples a group of responses per prompt and updates the policy via group-relative advantage signals. This work reveals that these optimization strategies share a common geometric structure: each implicitly defines a target distribution on the response simplex and projects toward it via first-order approximation. Building on this insight, we propose Listwise Policy Optimization (LPO) to explicitly conduct the target-projection, which demystifies the implicit target by restricting the proximal RL objective to the response simplex, and then projects the policy via exact divergence minimization. This framework provides (i) monotonic improvement on the listwise objective with bounded, zero-sum, and self-correcting projection gradients, and (ii) flexibility in divergence selection with distinct structural properties through the decoupled projection step. On diverse reasoning tasks and LLM backbones, LPO consistently improves training performance over typical policy gradient baselines under matched targets, while intrinsically preserving optimization stability and response diversity.