arXiv:2610.19614v1 Announce Type: new
Abstract: In this work, we reframe agentic trajectories as paths through a shared embedding space of actions and environmental observations. We show that success...
By Alexander Gill, Guram Gogia, Francisco Guzm\'an
arXiv:2610.15840v1 Announce Type: cross
Abstract: Reinforcement learning (RL) for large language model (LLM) agents remains challenging in long-horizon tasks with sparse outcome rewards, where assign...
By Kaijie Zhu, Weixiang Yan, Omar Attia, Abbas Kazerouni, Alexander Toshev, Andrew Szot
arXiv:2610.17666v1 Announce Type: cross
Abstract: Reinforcement learning with verifiable rewards (RLVR) for multi-turn agents relies on sparse terminal rewards that say little about individual steps....
By Xuyan Ye, Xiyan Fu, Shengda Fan, Jiawei Cui, Yankai Lin, Wei Lu
arXiv:2607. 21419v1 Announce Type: new Abstract: In long-horizon LLM agent reinforcement learning, weak policies often repeat similar failures, producing uninformative rollout trajectories and limiting effective policy optimization.
By Yipeng Shi, Zhipeng Ma, Yue Wang, Qitai Tan, Yang Li, Peng Chen, Zhengzhou Zhu
arXiv:2611.07932v1 Announce Type: cross
Abstract: Long-horizon LLM agents make multi-step decisions, yet outcome-reward-only reinforcement learning provides little direct supervision for individual s...
By Mengsong Wu, Tianchen Zhou, Zhaochen Su, Zhenhua Liu, Zhe Cui, Aimin Zhou
SCOPE is a new framework for selective critical‑step on‑policy self‑distillation in agentic reinforcement learning. After a supervised warm‑up, the policy examines its own trajectories, generates hindsight skills for each step, and distills guidance only at selected error steps, using a bounded teacher‑student coefficient and a success‑relative pairwise length reward. Experiments on ALFWorld and WebShop show consistent performance gains across multiple model backbones, with Qwen2.5‑3B achieving 97.7 % success on ALFWorld and 85.2 % on WebShop, and Qwen3‑32B reaching 99.2 % on seen tasks and 94.0 % on unseen tasks.
By Qirui Liu, Wei Cao, Yu Mi, Yichen Sun, Xuekun Zhang, Lei Liu, Yue Shen, Zhixuan Chu
The paper introduces Milestone Viability Potential Policy Optimization (MVPO), a reinforcement learning algorithm designed for long‑horizon large language model agents. MVPO addresses the zero‑credit failure problem by learning from viable failure prefixes, estimating prefix potential over Union‑Find viability regions, and repairing zero‑credit groups with potential‑difference advantages. Experiments on Qwen2.5‑1.5B‑Instruct demonstrate that MVPO outperforms eight strong baselines, improving success rates on ALFWorld and WebShop with minimal overhead.
By Qi Zhou, Yuanfan Li
The paper introduces Potential-Guided Policy Optimization (PGPO), a method for multi-turn agentic tasks that improves credit assignment by estimating empirical state potentials from anchor-state-group return statistics. PGPO derives action advantages from potential differences between adjacent states, enabling cross-trajectory credit propagation and finer-grained step-level credit assignment, especially within failed trajectories. Experiments on ALFWorld and WebShop demonstrate strong performance compared to recent group-based reinforcement learning methods, with negligible training overhead.
By Yuyao Zheng, Haipeng Sun, Junwei Bao, Lemao Liu, Hongfei Jiang, Yang Song, Dejing Dou
arXiv:2608. 07371v1 Announce Type: new Abstract: Recent agentic reinforcement learning methods use hindsight to complement sparse outcome rewards.
By Haoyu Zheng, Yun Zhu, Qing Wang, Wenqiao Zhang
arXiv:2608.30528v1 Announce Type: new
Abstract: Reinforcement learning (RL) is used to improve the reasoning abilities of LLMs, while training data span heterogeneous tasks. However, most RL post-tra...
By Yuanqiang Yu, Yanzhao Zheng, Zhentao Zhang, Tianze Xu, Chao Ma, Jihuai Zhu, Jiashun Liu, Xinle Deng, Baohua Dong, Hangcheng Zhu, Ruohui Huang
PlanPO introduces a group planning-aware policy optimization method for multi-turn agentic large language models, addressing the issue of advantage collapse caused by treating all successful trajectories equally. By incorporating coarse-to-fine advantage signals that reflect differences in trajectory and turn lengths, PlanPO encourages agents to learn generalizable planning and generation behaviors. Experiments show a 27.2% average improvement over GRPO on benchmarks such as ALFWorld, WebShop, and SciWorld, with minimal extra training cost.
By Dayang Liang, Liyuan He, Xuan Feng, Shuxin Li, Bo An, Yunlong Liu
The paper proposes a two-stage adaptive training framework for GUI agents that addresses both where to learn and how far to roll out during training. It creates reusable intermediate checkpoints from expert trajectories and selects informative pivots using action disagreement to focus one-step reinforcement learning on uncertain decisions. The method then progressively expands policy responsibility through adaptive Local, Suffix, and Root training, enabling repeated training from intermediate states and reducing environment interaction by 56‑61% while improving task performance on MobileGym and CUA‑Gym‑Hub.
By Yuxiang Chai, Quyu Kong, Panrong Tong, Steven Hoi, Yue Wang