Sign inGet started
Paper · arXiv

Group-Graph Policy Optimization for Long-Horizon Agentic Reinforcement Learning

Group-based Reinforcement Learning (RL) has significantly enhanced Large Language Models (LLMs) in agentic scenarios. To achieve finer-grained policy updates, recent agentic RL frameworks have shifted from trajectory-level to step-level training. However, long-horizon agentic RL suffers from severe reward sparsity and delay, as feedback is often deferred for dozens of interaction steps. While existing step-level frameworks refine training granularity, their credit assignment remains coarse-grained and still treats agent exploration as isolated, linear trajectories. This oversimplified perspective ignores the inherent graph structure of state transitions, leading to high-variance state-val...

AuthorsYunan Wang, Minghui Song, Zihan Zhang et al.
Primary categorycs.LG
Published22 June 2026
Last updated at source22 June 2026
cs.LGcs.AIcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/df0160ed-3ade-4f02-9720-bea8fd326701" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.