arXiv AI

EDGE: Experience-Distillation for Guided Exploration in Agentic Reinforcement Learning

arXiv Computation and Language
Aug 27

AEL: Evolving Agent Harness in Open-Ended Environments

The paper introduces Agent Evolving Learning (AEL), a two‑timescale framework that dynamically evolves an LLM agent’s memory‑retrieval harness in open‑ended environments. A fast Thompson‑Sampling bandit selects among retrieval policies each episode, while a slower LLM reflection diagnoses performance drops and injects new policies when the current set plateaus. AEL outperforms ten self‑improving and non‑LLM baselines on a sequential portfolio benchmark, boosting Sharpe ratio by 27% and achieving significant accuracy gains on a support‑ticket routing stream.

By Wujiang Xu, Jiaojiao Han, Minghao Guo, Kai Mei, Xi Zhu, Han Zhang, Dimitris N. Metaxas
arXiv Computation and Language
Sep 10

Why Do LLM Agents Fail in Exploring New Environments? A World-Modeling Perspective

arXiv:2510.15047v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) as agents often fail to improve in new environments. We identify and characterize a failure mode we call explora...

By Shiqi Chen, Tongyao Zhu, Zian Wang, Jinghan Zhang, Kangrui Wang, Ruochen Zhou, Siyang Gao, Teng Xiao, Yee Whye Teh, Junxian He, Manling Li
arXiv AI
Sep 4

Headroom-Drift Replay: A Primitive for Principled Replay Control in GRPO

Headroom-Drift Replay is a replay control primitive designed for GRPO that separates reuse into two decisions: Headroom ranks stored groups by remaining learning value, while Drift gates them by compatibility with the current policy. The method keeps the fresh on‑policy stream unchanged and adds no auxiliary generation or training machinery. Across mathematical reasoning, multimodal reasoning, and Agentic Search benchmarks, it outperforms naive replay and matches or exceeds broader replay methods on Avg Mean@32, delivering comparable quality at materially lower wall‑clock time in Agentic Search.

By Hyun Bin Park, Du-Seong Chang
arXiv Machine Learning
Sep 4

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

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.

By Jinwei Gan
arXiv Machine Learning
Jun 30

Complementary RL: Towards Efficient Experience-Driven Agent Learning

arXiv:2603. 17621v2 Announce Type: replace Abstract: Reinforcement Learning (RL) has emerged as a powerful paradigm for training LLM-based agents, yet remains limited by low sample efficiency, stemming not only from sparse outcome feedback but also from the agent's inability to leverage prior experience across episodes.

By Dilxat Muhtar, Jiashun Liu, Wei Gao, Weixun Wang, Shaopan Xiong, Ju Huang, Siran Yang, Wenbo Su, Jiamang Wang, Ling Pan, Bo Zheng