ProAS: A Progress-Aware Advantage Shaping Framework for Multi-Turn Agentic Reinforcement Learning
To resolve this without introducing critic overhead, we propose Progress-Aware Advantage Shaping (ProAS), a plug-and-play framework that leverages a dynamically evolving Agentic Reference Graph (ARG) to achieve fine-grained credit assignment via Masking Unreasonable Incentives (MUI) and Asymmetric Penalty Redistribution (APR).
ProofPaper ↗
Key points
- Reinforcement learning (RL) has emerged as the primary paradigm for optimizing Large Language Model (LLM) agents, yet efficient critic-free algorithms (e.g., GRPO) suffer from a fundamental uniform credit assignment dilemma that broadcasts trajectory-level advantages equally to all actions.
- Our analysis reveals that this uniformity inherently reinforces structurally invalid actions in preferred trajectories and ignores the downstream cascading influence of early pivotal deviations in unpreferred ones.
- Extensive experiments across Qwen2.5-1.5B-Instruct and Qwen2.5-7B-Instruct demonstrate that ProAS universally elevates mainstream group-based baselines to new state-of-the-art performance, achieving peak success rates of 91.9% and 94.3% on ALFWorld, alongside 66.7% and 70.8% on WebShop, respectively.
- Furthermore, it accelerates training convergence by up to $2.44\times$ while maintaining strong robustness against imperfect or distilled ARGs.
Sources (1)
- [1]ProAS: A Progress-Aware Advantage Shaping Framework for Multi-Turn Agentic Reinforcement LearningarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 13, 04:39 PM
To resolve this without introducing critic overhead, we propose Progress-Aware Advantage Shaping (ProAS), a plug-and-play framework that leverages a dynamically evolving Agentic Reference Graph (ARG) to achieve fine-grained credit assignment via Masking Unreasonable Incentives (MUI) and Asymmetric Penalty Redistribution (APR).
Reinforcement learning (RL) has emerged as the primary paradigm for optimizing Large Language Model (LLM) agents, yet efficient critic-free algorithms (e.g., GRPO) suffer from a fundamental uniform credit assignment dilemma that broadcasts trajectory-level advantages equally to all actions.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 13, 2026Gemini 4 Argon: Built to solve your hardest problems
- Oct 13, 2026TSRL: Trigger-based Supervised Reinforcement Learning for Continual Agent Training
- Oct 13, 2026Can an Agent Learn to Predict Its Own Failure? Outcome-Grounded Confidence Calibration in LLM Agents
- Oct 13, 2026Fish Audio Drama 3 Technical Report
- Oct 13, 2026GroundGUI: GUI Grounding by High-Quality Data and Distillation-to-Reinforcement Learning
- Oct 13, 2026DeltaTTG: Training Multi-Turn Agents with a Token-to-Go Progress Meter
