arXiv Machine Learning By Jinwei Gan

TIGPO: Temporal Instance-Graph Policy Optimization for Long-Horizon LLM Agents

Read the original on arXiv Machine Learning →

TIGPO (Temporal Instance-Graph Policy Optimization) extends graph-based credit assignment for long-horizon LLM agents by maintaining a persistent transition graph per task across policy updates. It allocates rollout budgets to both new exploration and revisiting past tasks, pairing current rollouts with earlier ones to create cross‑temporal references that stabilize advantage estimation. Experiments on ALFWorld and WebShop show TIGPO consistently outperforms previous group‑based and graph‑based policy optimization methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Oct 19

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

Group-Graph Policy Optimization (G2PO) is a novel group-based reinforcement learning algorithm designed for long-horizon agentic tasks. It transforms linear interaction trajectories into a global state‑transition graph, aggregates identical observations across trajectories to reduce sampling variance, and redefines actions as transitions between state nodes. By employing an edge‑centric advantage estimation and globally standardizing TD errors, G2PO identifies and prioritizes critical transitions, achieving up to 22.2% higher success rates than state‑of‑the‑art baselines on benchmarks such as WebShop, ALFWorld, and AppWorld.

By Yunan Wang, Minghui Song, Zihan Zhang, Shaohan Huang, Haizhen Huang, Furu Wei, Weiwei Deng, Feng Sun, Qi Zhang
arXiv AI
Sep 10

Tracking the Moving Frontier: Long-Short Term Advantage Estimator

The paper introduces Long-Short Term Advantage Estimator (LSTAE), a single‑stream reinforcement learning algorithm that replaces repeated within‑iteration trajectory sampling with historical experience for advantage estimation. LSTAE tracks each task anchor with a drift‑aware long‑term baseline and a short‑term state‑experience buffer, converting accumulated experience into multi‑granular credit signals while requiring only one rollout per anchor. Experiments on agentic and mathematical reasoning benchmarks show that LSTAE matches or surpasses strong group‑based baselines while significantly reducing rollout cost.

By Xinhao Yao, Lu Yu, Changhao Wang, Fengwei Teng, Yuyao Zhang, Qing Cui, Jun Zhou, Yong Liu