Skip to content

TAPO: Transition-Aware Policy Optimization for LLM Agents

Jul 2026 · arXiv.org · Vol abs/2607.27973 · 1 citation · 45 references
Computer Science

TL;DR

This work proposes TAPO: Transition-Aware Policy Optimization for LLM Agents, a unified training framework that alternates between policy optimization and transition supervision, and demonstrates that TAPO consistently improves task performance over pure policy optimization baselines.

Abstract

Recently, Reinforcement Learning (RL) has emerged as a crucial paradigm for the post-training of Large Language Model (LLM) agents. However, existing methods predominantly rely on sparse task rewards for policy optimization, failing to fully exploit another class of inherently dense supervisory signals naturally present during online interaction: environmental feedback following action execution. Recent theoretical studies suggest that generalization in multi-step, goal-oriented tasks hinges on predictive knowledge of environmental consequences. Inspired by this, we propose TAPO: Transition-Aware Policy Optimization for LLM Agents, a unified training framework that alternates between policy optimization and transition supervision. Beyond standard RL updates, TAPO repurposes rollout data to apply action-conditioned next-observation prediction supervision on a shared backbone model. This approach enhances the model's sensitivity to environmental transition dynamics and action consequences while concurrently optimizing the policy. It serves as a computationally lightweight, plug-and-play enhancement module for existing agent RL algorithms, requiring no additional expert data, extra sampling costs, or inference-time overhead. We conduct systematic experiments on WebShop and ALFWorld, integrating foundation models of various scales with different policy optimization algorithms. Empirical results demonstrate that TAPO consistently improves task performance over pure policy optimization baselines.

View source

Similar papers

Book Open access Aug 2026

InfRL: Inference-time Reinforcement Learning for Research Idea Optimization

Large language models (LLMs) possess extensive latent knowledge yet remain largely static at inference. Once prompted, their generation policy typically cannot evolve, and post-hoc ''self-reflection'' methods provide no explicit principled learning signals. To address this limitation, we formally model iterative resear...

Sikun Guo, Amir Hassan Shariatmadari, Jiuqi Wang et al. · 0 citations
Jul 2026

SEED: Self-Evolving On-Policy Distillation for Agentic Reinforcement Learning

SEED (SElf-Evolving On-Policy Distillation), a self-evolving framework that converts completed on-policy trajectories into training-time hindsight skills and distills their behavioral effect back into the policy model, is proposed.

Jinyang Wu, Shuo Yang, Zhengxi Lu et al. · 7 citations
Preprint Jul 2026

Single-Rollout Asynchronous Optimization for Agentic Reinforcement Learning

Single-rollout Asynchronous Optimization (SAO) is presented to address the stability and off-policy challenges in asynchronous RL and is able to train stably for one thousand steps and consistently outperform GRPO and its variants on agentic coding and reasoning benchmarks.

Zhenyu Hou, Yujiang Li, Jie Tang et al. · 10 citations · ⚡2
Preprint Aug 2026

IB-RL: Isolated Bilateral Reinforcement Learning for Strategic Dialogue Agents

Isolated Bilateral Reinforcement Learning (IB-RL), in which the two roles coevolve through joint rollouts while each role optimizes its own reward through fully independent advantages, action masks, and update paths, produces policies that generalize more effectively to unseen counterparts.

Senhao Wang, Chenghao Cai, Hai-Tao Hu et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Q-Learning With World Models

This work proposes QWM, a framework that leverages world models to perform test-time search over imagined trajectories on top of Q-learning to select high-value actions during both online rollouts and evaluation, and significantly outperforms strong prior state-of-the-art methods on both sample efficiency and performan...

Perry Dong, Yue-Ru Jia, Chelsea Finn et al. · 2 citations
Jul 2026

Agentic-DPO: From Imitation to Agentic Policy Optimization on Expert Trajectories

This work proposes Agentic-DPO, a lightweight offline agent policy optimization method that turns expert trajectories into state-conditioned preference supervision, and introduces Policy-Preserving Augmentation (PPA), which renders the same latent trajectory under multiple schemas while keeping the expert policy fixed.

Yi-Xiong Chen, A. Yuille · 3 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.