PGPO: Potential-Guided Policy Optimization for Multi-Turn Agentic Tasks
Summary
PGPO proposes potential-guided policy optimization for multi-turn agentic tasks, enabling finer-grained credit assignment in LLM post-training and showing strong results on ALFWorld and WebShop benchmarks.
View Cached Full Text
Cached at: 09/03/26, 06:03 AM
# PGPO: Potential-Guided Policy Optimization for Multi-Turn Agentic Tasks Source: [https://arxiv.org/abs/2609.02236](https://arxiv.org/abs/2609.02236) [View PDF](https://arxiv.org/pdf/2609.02236) > Abstract:Group\-based reinforcement learning \(RL\) has become an effective paradigm for LLM post\-training, but in multi\-turn agentic tasks with sparse terminal rewards, it often provides coarse credit for intermediate actions\. To obtain more fine\-grained credit assignment, recent work such as GiGPO introduces step\-level advantages for intermediate actions\. However, these step\-level signals still rely on the final outcome of each individual trajectory\. As a result, actions within failed trajectories can remain poorly differentiated, so effective actions can receive the same unfavorable credit as erroneous ones\. In this work, we propose Potential\-Guided Policy Optimization \(PGPO\) for multi\-turn agentic tasks\. PGPO estimates empirical state potentials from anchor\-state\-group return statistics within each rollout group\. It then derives action advantages from potential differences between adjacent states, enabling cross\-trajectory credit propagation\. This provides finer\-grained step\-level credit assignment, especially within failed trajectories\. Experiments on ALFWorld and WebShop show strong overall performance relative to recent group\-based RL methods\. Further analysis provides evidence that PGPO yields more informative failure\-side credit signals with negligible training overhead\. ## Submission history From: Yuyao Zheng \[[view email](https://arxiv.org/show-email/0022beab/2609.02236)\] **\[v1\]**Wed, 2 Sep 2026 07:44:16 UTC \(2,881 KB\)
Similar Articles
GAGPO: Generalized Advantage Grouped Policy Optimization
GAGPO proposes a critic-free RL method that uses a non-parametric grouped value proxy for step-level credit assignment in multi-turn agentic tasks, outperforming strong baselines on ALFWorld and WebShop.
PlanPO: Group Planning-Aware Policy Optimization for Multi-Turn Agentic LLMs
PlanPO is a reinforcement learning method that introduces coarse-to-fine advantage signals for multi-turn agentic LLMs, improving performance over GRPO by 27.2% on benchmarks like ALFWorld, WebShop, and SciWorld.
Progress- and Reliability-Oriented Group Policy Optimization for Agentic Reinforcement Learning
ProGPO is a learned-critic-free method for step-level advantage estimation in group-based RL for LLM agents, using exact-prefix action comparisons and rollout-based state potentials to improve credit assignment on long-horizon tasks. Experiments on ALFWorld and WebShop with Qwen2.5 models show it outperforms existing agentic RL baselines.
Progress-conditioned Group Policy Optimization for Long-Horizon Agentic Tasks
Proposes Progress-conditioned Group Policy Optimization (ProGPO) to overcome credit assignment issues in long-horizon agentic tasks by using first-visit observation coverage when all group samples fail, improving performance on ALFWorld and WebShop.
A^2TGPO: Agentic Turn-Group Policy Optimization with Adaptive Turn-level Clipping
This paper introduces A^2TGPO, a reinforcement learning method for agentic LLMs that uses adaptive turn-level clipping and information gain normalization to improve process credit assignment in multi-turn interactions.