atlas

Research map / Reinforcement learning / RL from feedback

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

NeurIPS 2026 · Reinforcement learning › RL from feedback · approach: RL for LLM reasoning · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes G2PO, a group-based step-level agentic RL method that merges identical observations across sampled trajectories into a state-transition graph, averages state values over each group, and globally standardizes edge TD errors for advantage estimation.

Problem

Long-horizon agentic RL suffers from sparse, delayed rewards; existing step-level group methods (e.g., GiGPO) estimate state values from single trajectories and compare actions only locally, causing high-variance value estimates and myopic credit assignment.

Approach

Build a global state-transition graph by clustering identical observations across trajectories; estimate each state's value as the mean of its group's discounted outcomes, treat actions as edges, and standardize edge TD errors over the whole graph (edge-centric advantage) combined with node-centric and episode-level advantages.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: WebShop ALFWorld AppWorld

Benchmarks: WebShop ALFWorld AppWorld

Metrics: success rate score number of interaction turns

Baselines: Qwen3.5-397B DeepSeek-V3.2 Gemini-2.5-Pro ReAct Reflexion PPO RLOO GRPO GiGPO

Builds on: GRPO GiGPO RLOO PPO verl-agent

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy