arXiv Computation and Language

Reinforcement World Model Learning for LLM-based Agents

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
Jun 2

Policy and World Modeling Co-Training for Language Agents

arXiv:2606. 02388v1 Announce Type: cross Abstract: Reinforcement learning (RL) improves large language model (LLM) agents by teaching them which actions lead to high rewards, but provides little supervision on what those actions do to the environment.

By Ning Lu, Baijiong Lin, Shengcai Liu, Jiahao Wu, Haoze Lv, Yanbin Wei, Lingting Zhu, Shengju Qian, Xin Wang, Ying-Cong Chen, Qi Wang, Ke Tang
arXiv AI
Oct 19

Language Models Learn to Improve Language Models

The paper introduces LM2LM, a method that trains large language models (LLMs) to propose improvements for other LLMs using reinforcement learning (RL). It employs a frozen research world model (RWM) to predict the gains of proposals, providing a cheaper surrogate reward, and periodically validates high‑scoring proposals to keep feedback reliable. Experiments across eight LM development environments show that LM2LM enables a Qwen3.8‑27B model to outperform GPT‑6‑sol on held‑out tasks while reducing data‑generation cost by 33%, and it generalizes to unseen model families.

By Minhua Lin, Zijun Wang, Zewen Liu, Zhaotian Weng, Bing He, Zhan Shi, Benoit Dumoulin, Xiang Zhang, Suhang Wang, Hanqing Lu
arXiv AI
Sep 4

CoMAP: Co-Evolving World Models and Agent Policies for LLM Agents

CoMAP introduces a framework that jointly evolves textual world models and agent policies through a closed‑loop interaction. At each decision step the world model forecasts future state feedback for candidate actions, while the agent reflects on the reliability of this feedback to refine its action. The resulting on‑policy trajectories are used to self‑distill and update the world model, improving prediction accuracy and long‑horizon decision‑making across embodied planning, web navigation, and tool‑use benchmarks.

By Youwei Liu, Jian Wang, Hanlin Wang, Wenjie Li
arXiv Machine Learning
4d ago

Natural Language Actor-Critic: Scalable Off-Policy Learning in Language Space

Natural Language Actor-Critic (NLAC) is a new actor‑critic algorithm that trains large language model (LLM) agents by using a generative LLM critic to produce natural‑language feedback instead of scalar rewards. By providing richer, actionable explanations for suboptimal actions, NLAC helps LLM policies improve without relying on random exploration, and it can be trained off‑policy without policy gradients. Experiments on reasoning, web browsing, tool‑use, and dialogue tasks show that NLAC outperforms existing training methods and offers a more scalable and stable training paradigm for LLM agents.

By Joey Hong, Kang Liu, Zhan Ling, Jiecao Chen, Sergey Levine
arXiv Machine Learning
Oct 7

Independent Multi-Agent Reinforcement Learning with Counterfactual Semantic-Social World Models

The paper introduces CASTLE, a framework for fully decentralized multi‑agent reinforcement learning that uses two offline‑trained world models to provide in‑context guidance to independent agents. A Local Dynamics World Model captures each agent’s trajectory dynamics, while a Semantic‑Social World Model predicts short‑horizon task and social outcomes for candidate actions based on counterfactual simulator rollouts. During online learning, these frozen models supply prediction logits to an independent PPO policy, enabling agents to compare potential actions prospectively rather than relying solely on scalar rewards. CASTLE outperforms existing baselines on several multi‑particle benchmark tasks, achieving the highest mean final scores across 30 seeds.

By Fernando Martinez, Tao Li, Yingdong Lu, Juntao Chen