A2TGPO: Agentic Turn-Group Policy Optimization with Adaptive Turn-level Clipping
On the map: LLM agents and tool use → Reinforcement learning for LLM agents
Abstract (arXiv)
Reinforcement learning for agentic large language models (LLMs) typically relies on a sparse, trajectory-level outcome reward, making it difficult to evaluate the contribution of individual tool-calls within multi-turn interactions. Existing approaches to such process credit assignment either depend on separate external process reward models that introduce additional consumption, or tree-based structural rollout that merely redistributes the outcome signal while constraining trajectory diversity. A promising alternative leverages the per-turn change in the policy's predicted probability of the ground-truth, termed Information Gain (IG), as an intrinsic process signal without an external evaluator. However, prior work on leveraging IG signals within the RL training loop faces three systematic challenges: normalizing across turns that face heterogeneous positional contexts can distort the relative standing of individual turns, accumulating a variable number of terms causes advantage magnitudes to drift with trajectory depth, and a fixed clipping range governs policy updates identically for turns with vastly different IG signals. In this paper, we propose A2TGPO (Agentic Turn-Group Policy Optimization with Adaptive Turn-level Clipping), which retains IG as the intrinsic signal but re-designs how it is normalized, accumulated, and consumed: (i) turn-group normalization: normalizes IG within each (prompt, turn-index) group so that each turn is compared only against peers at the same interaction depth; (ii) variance-rescaled discounted accumulation: divides cumulative normalized IG by square root of accumulated terms to keep advantage magnitudes comparable across turn positions; and (iii) adaptive turn-level clipping: modulates each turn's clipping range based on its normalized IG, widening the update region for informative turns and narrowing it for uninformative ones.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Reinforcement learning for LLM agents, one of 16 directions in LLM agents and tool use. Builds on 25 of its 31 references that are in the map. First posted on arXiv 7 May 2026.
Builds on
25 of 31 references.
Closest ancestors · 3
Same direction, newest first
- 2025Information Gain-based Policy Optimization: A Simple and Effective Approach for Multi-Turn Search Agents16 Oct
- 2025Group-in-Group Policy Optimization for LLM Agent Training16 May
- 2025Process Reward Models for LLM Agents: Practical Framework and Directions14 Feb
Other references · 22
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,695
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2023Let's Verify Step by Stepcited by 3,789
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2020Learning to summarize from human feedbackcited by 2,588
- 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 2,057
- 2025Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learningcited by 1,444
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,282
10 more
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,075
- 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 928
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 916
- 2024Rewarding Progress: Scaling Automated Process Verifiers for LLM Reasoningcited by 279
- 2024Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learningcited by 241
- 2025WebDancer: Towards Autonomous Information Seeking Agencycited by 188
- 2025TreeRL: LLM Reinforcement Learning with On-Policy Tree Searchcited by 80
- 2025M2IV: Towards Efficient and Fine-grained Multimodal In-Context Learning via Representation Engineeringcited by 35
- 2025Make LVLMs Focus: Context-Aware Attention Modulation for Better Multimodal In-Context Learningcited by 19
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026AT2PO: Agentic Turn-based Policy Optimization via Tree Search
- 2026RTPO: Reverse-Turn Policy Optimization for Stabilizing Agentic RL Training
- 2026Information Gain-based Rollout Policy Optimization: An Adaptive Tree-Structured Rollout Approach for Multi-Turn LLM Agents
- 2025Agentic Reinforced Policy Optimization
- 2025Reinforcing Multi-Turn Reasoning in LLM Agents via Fine-Grained Reward Structure and Credit Assignment
- 2026CIGPO: Contextual Information-Gain Policy Optimization for Multi-Turn Evidence-Reading LLM Agents
- 2026ProAS: A Progress-Aware Advantage Shaping Framework for Multi-Turn Agentic Reinforcement Learning
- 2025In-the-Flow Agentic System Optimization for Effective Planning and Tool Use