[Paper] APPO: Agentic Procedural Policy Optimization

Published: (June 10, 2026 at 01:47 PM EDT)
2 min read
Source: arXiv

Source: arXiv - 2606.12384v1

Overview

Recent advances in agentic Reinforcement Learning (RL) have substantially improved the multi-turn tool-use capabilities of large language model agents. However, most existing methods assign credit over coarse heuristic units, such as tool-call boundaries or fixed workflows, making it difficult to identify which intermediate decisions influence downstream outcomes. In this work, we study agentic RL from two perspectives: \textit{where to branch and how to assign credit after branching}. Our pilot analysis shows that influential decision points are broadly distributed throughout the generated sequence rather than concentrated at tool calls, while token entropy alone does not reliably reflect their impact on final outcomes. Motivated by these observations, we propose \textbf{Agentic Procedural Policy Optimization (APPO)}, which shifts branching and credit assignment from coarse interaction units to fine-grained decision points in the sequence. APPO selects branching locations using a Branching Score that combines token uncertainty with policy-induced likelihood gains of subsequent continuations, enabling more targeted exploration while filtering out spurious high-entropy positions. It further introduces procedure-level advantage scaling to better distribute credit across branched rollouts. Experiments on 13 benchmarks show that APPO consistently improves strong agentic RL baselines by nearly 4 points, while keeping efficient tool-calls and maintaining behavior interpretability.

Key Contributions

This paper presents research in the following areas:

  • cs.LG
  • cs.AI

Methodology

Please refer to the full paper for detailed methodology.

Practical Implications

This research contributes to the advancement of cs.LG.

Authors

  • Xucong Wang
  • Ziyu Ma
  • Yong Wang
  • Yuxiang Ji
  • Shidong Yang
  • Guanhua Chen
  • Pengkun Wang
  • Xiangxiang Chu

Paper Information

  • arXiv ID: 2606.12384v1
  • Categories: cs.LG, cs.AI
  • Published: June 10, 2026
  • PDF: Download PDF
0 views
Back to Blog

Related posts

Read more »