Paper recorded by Signals 4 on 2026-09-14 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-14 on arXiv · recorded by Signals 4 on 2026-09-15
Category: cs.LG · 机器学习 · first seen 2026-09-15
Reinforcement learning with verifiable rewards (RLVR) improves the reasoning capabilities of large language models (LLMs). We introduce Bellman Policy Optimization (BPO), a critic-free method derived from Policy Mirror Descent (PMD). For autoregressive generation with terminal rewards, BPO uses the Bellman equations to reformulate PMD as a trajectory-level objective. The reformulation avoids estim