CoPE

Co-Evolving Acting and Forecasting for Language Agents

Haofei Yu1*, Yixing Chen2*, Yining Zhao1, Xuyan Ye1, Yuxiang Liu1,
Zhigang Hua3, Yan Xie3, Shuang Yang3, Jiaxuan You1

1University of Illinois Urbana-Champaign  ·  2University of California San Diego  ·  3Meta AI

*Equal contribution

Abstract

Agentic reinforcement learning learns only from a terminal scalar reward, so most of a long rollout goes unused. Per-step value targets all derive from that one scalar, and next-observation targets are long, noisy, and reach only one step ahead. CoPE adds multi-step action targets: on successful trajectories, the policy backbone is also trained to forecast the actions that follow each history, so acting and forecasting co-evolve in one model. At inference it still acts one step at a time, with no overhead. Across ALFWorld, ScienceWorld, WebShop, τ2-bench, and AppWorld, CoPE outperforms GRPO and predictive-auxiliary baselines with up to 2.0× the sample efficiency, using no extra models, pretraining stages, or inference-time cost.

+5.0 success-rate points over GRPO on ALFWorld, +12.5 on WebShop, +8.0 on ScienceWorld
2.0× more sample-efficient than GRPO on ScienceWorld, 1.6× on AppWorld
0 extra models, pretraining stages, or inference-time cost — one backbone

Why predict action sequences?

A trajectory, rewarded only at the end Value targets V(ht) Observation targets ôt+1 Multi-step action targets at:t+3 (CoPE) o0 a0 o1 a1 o2 a2 o3 a3 o4 a4 o5 a5 YY = 1 history ht (t = 2) ? 1 1 1 1 1 1 shared: every step gets the same scalar ô3 · terminal logrelevantlong · noisy one step ahead, and mostly noise short, clean, step-specific, K steps ahead
One reward, many steps. A rollout is a sequence of observations and actions, but the only supervision is a scalar Y at the very end. What should each history ht learn to predict? Value targets. Estimate how likely success is from ht. The label is the same Y for every step of the trajectory, so no step gets anything step-specific. Observation targets. Predict the next observation. Web pages and terminal logs are long and mostly noise, and the target reaches only one step ahead. Multi-step action targets (CoPE). Forecast the next K actions from ht. Each target is short and clean, differs by step, and reaches K steps ahead.
AppWorld CoPE (ours) GRPO 0 25 50 75 100 0.0 0.3 0.6 0.9 training steps task score score 0.5 1.6× fewer steps
Sample efficiency on AppWorld. Task score during training for CoPE and GRPO, same backbone and same rollout budget per step. 1.6× fewer steps. CoPE reaches a 0.5 task score at about step 50; GRPO needs about 80. On ScienceWorld the gap grows to 2.0×.

Method

Two rollouts, one shared backbone ℒGRPO: the current action, all rollouts ℒAF: forecast the next K actions, successful rollouts only ℒ = ℒGRPO + λ ℒAF history h2 (seen so far) o0 a0 o1 a1 o2 a2 o3 a3 o4 a4 o5 a5 o0 a0 o1 a1 o2 a2 o3 a3 o4 a4 o5 a5 Y(τ) = 0 Y(τ) = 1 k = 0 k = 1 k = 2 k = 3 a3:5 of a failed rollout: not used πθ pθ pθ pθ act a2 ℒGRPOall rollouts ℒAFonly Y(τ) = 1 + λ ∇θ ∇θ Shared LLM backbone θ · πθ acts, pθ forecasts
Two rollouts, one backbone. Each rollout is scored once at the end: Y(τ) = 0 for failure, 1 for success. The same LLM produces every action. ℒGRPO on all rollouts. The policy πθ is updated on the current action at of every rollout, with the group-relative advantage from Y. ℒAF on successful rollouts only. From the same history, the backbone also forecasts at+1, at+2, at+3 and is fit to them by supervised learning. Failed rollouts contribute nothing here. ℒ = ℒGRPO + λ ℒAF. Both losses backpropagate into the same parameters θ, so acting and forecasting share every weight of the backbone.
a0 a1 a2 a3 a4 a5 a6 h0 h1 h2 h3 h4 h5 h6 action ak history ht 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 0 1 0 ℒ = ℒGRPO + λ ℒAF k = 0 · the current action (GRPO)policy gradient on all rollouts k = 1 … K · forecast actions (AF)row by row: ht forecasts at:t+K a4 is forecast from h1, h2, h3, h4a temporal ensemble of K + 1 histories
Where does the loss land? Rows are histories ht, columns are actions. A cell is supervised when the model is asked to produce that action from that history. GRPO: the diagonal. Each history is scored only on its own next action, k = 0, with the policy-gradient loss on all rollouts. The loss runs along rows. One extra SFT loss: on successful rollouts, each history ht forecasts its next K actions at:t+K. Row by row, the diagonal becomes a band. The effect reads along columns. Every action is now forecast from K + 1 histories, not just its own. The shared backbone absorbs this temporal ensemble, so forecasting improves acting.

Acting helps forecasting via trajectory collection

The forecasting targets come from the policy itself: they are the action chunks of the successful rollouts it collects. For a fixed rollout policy, the forecasting loss is minimized by the policy's own chunks reweighted by their chance of success, which the success filter implements by rejection sampling. That target is always a step ahead of the policy that produced it, and a better policy supplies more successful rollouts, so forecasting gets more and better targets as training goes on.

Forecasting helps acting via implicit temporal ensembling

Read by column in the grid above, each action of a successful rollout is forecast from the K preceding histories as well as its own, so it receives K + 1 supervision signals instead of the single one GRPO gives it. These forecasts agree with acting: they are conditionals of the same hindsight distribution, so the best forecast of at from an earlier history equals the GRPO target marginalized over the observations in between. Because forecaster and policy share parameters, those forecasts are folded into πθ: an ensemble over time that costs nothing at inference.

Results

Main results. CoPE against GRPO trained in the same setup, and the strongest prior RL method on each benchmark (ECHO on the simulated tasks; InfoPO on τ2-bench and GiGPO on AppWorld, as published). ALFWorld counts success over all subtasks; AppWorld is the Normal split with Qwen2.5-14B-Instruct, every other benchmark uses Qwen2.5-7B-Instruct. Prompting baselines, the remaining RL methods and the AppWorld Challenge split are in the table view.
ALFWorld success rate (%) 0 50 100 ECHO · ALFWorld: 94.594.5ECHO GRPO · ALFWorld: 90.590.5GRPO CoPE · ALFWorld: 95.595.5CoPE
WebShop success rate (%) 0 50 100 ECHO · WebShop: 71.571.5ECHO GRPO · WebShop: 64.564.5GRPO CoPE · WebShop: 77.077.0CoPE
ScienceWorld success rate (%) 0 50 100 ECHO · ScienceWorld: 67.567.5ECHO GRPO · ScienceWorld: 64.564.5GRPO CoPE · ScienceWorld: 72.572.5CoPE
τ²-bench overall Avg@4 (%) 0 25 50 InfoPO · τ²-bench: 17.717.7InfoPO GRPO · τ²-bench: 27.527.5GRPO CoPE · τ²-bench: 28.728.7CoPE
AppWorld Normal split (%) 0 30 60 GiGPO · AppWorld: 25.725.7GiGPO GRPO · AppWorld: 41.741.7GRPO CoPE · AppWorld: 55.455.4CoPE
Table view (all methods)
Simulated agent tasks. ALFWorld reports success rate (%) per subtask and overall; WebShop and ScienceWorld report average score and success rate (%). All RL methods use Qwen2.5-7B-Instruct.
Method ALFWorld WebShop ScienceWorld
PickLookCleanHeatCoolPick2All ScoreSucc. ScoreSucc.
Agentic prompting
Gemini-2.5-flash-lite82.636.837.820.021.448.946.07.86.513.915.0
GPT-5-mini82.647.427.036.014.375.652.011.77.040.143.5
GPT-5.597.8100.091.988.089.393.393.566.156.566.879.0
Qwen2.5-7B69.631.629.736.017.911.134.025.32.5−13.32.5
Qwen2.5-7B + Reflexion84.826.351.444.032.155.654.021.94.0−3.76.0
RL methods w/o auxiliary loss
RFT91.373.773.084.064.371.177.051.416.0−11.04.5
GRPO100.073.794.684.089.388.990.584.164.552.864.5
GRPO + EMPG97.857.989.288.089.395.689.584.367.548.246.5
RL methods w/ auxiliary loss
RWML + GRPO100.089.589.292.096.484.492.081.264.039.465.0
ECHO97.889.591.996.096.493.394.585.071.544.867.5
CoPE100.0100.097.396.089.391.195.589.477.053.472.5
τ2-bench. Avg@4 task success rate with Qwen2.5-7B-Instruct.
MethodTelecomRetailAirlineOverall
Agentic prompting
Qwen2.514.413.17.511.7
ReAct13.113.810.012.3
Published RL results
RAGEN17.517.515.016.7
Search-R115.615.010.013.5
UserRL13.816.97.512.7
InfoPO18.118.816.317.7
Our controlled runs
GRPO (ours)38.817.526.227.5
CoPE40.629.416.228.7
AppWorld. Success rate (%) with Qwen2.5-14B-Instruct. † marks results reported in G2PO.
MethodNormalChallenge
Agentic prompting
Qwen2.51.20.7
ReAct10.72.6
Published RL results
PPO†19.1—
RLOO†24.8—
GiGPO†25.7—
GRPO†24.8—
Our controlled runs
GRPO (ours)41.718.7
CoPE55.422.5

Cost

Inference: no extra cost. The forecasting objective is used only in training. At inference the agent acts with πθ alone, one action per step and without the forecasting instruction, so a CoPE policy costs exactly what a GRPO-trained policy costs.

Training: +11% per step, −9% end to end. On ScienceWorld the forecasting pass adds 11% time per training step on average, while the shorter rollouts a better policy produces cut the measured end-to-end step time by 9% compared with GRPO. There is no separate model and no pretraining stage.

BibTeX

@article{yu2026cope,
  title   = {Co-Evolving Acting and Forecasting for Language Agents},
  author  = {Yu, Haofei and Chen, Yixing and Zhao, Yining and Ye, Xuyan and
             Liu, Yuxiang and Hua, Zhigang and Xie, Yan and Yang, Shuang and
             You, Jiaxuan},
  journal = {arXiv preprint arXiv:2610.20597},
  year    = {2026}
}