When Denser Credit Is Not Enough: Evidence-Calibrated Policy Optimization for Long-Horizon LLM Agent Training
About
Long-horizon LLM agents require reinforcement learning methods that can assign credit to intermediate decisions under sparse and delayed rewards. Recent group-based methods such as GiGPO improve over GRPO by constructing step-level advantages at repeated anchor states. However, we show that such dense credit can be statistically unreliable: under limited rollouts, rare but lucky actions may receive overly large advantages, producing divergent anchor bias and late-stage training oscillation. We propose Evidence-Calibrated Policy Optimization (ECPO), a critic-free policy optimization algorithm that calibrates step-level credit before policy updates. ECPO combines Evidence-Calibrated Action Advantage, which groups rollouts by canonical actions and shrinks low-count estimates, with Variance-Gated Credit Weighting, which suppresses anchor states dominated by within-action noise. Experiments on ALFWorld and WebShop with Qwen2.5-1.5B/7B show that ECPO consistently outperforms strong baselines, improving GiGPO by +5.2/+7.3 success points on ALFWorld/WebShop with Qwen2.5-1.5B while adding only 0.1% additional advantage-computation overhead.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Single-hop Question Answering | PopQA out-of-domain | Accuracy44.1 | 24 | |
| Web-based Task Automation | WebShop (test) | Score85.5 | 18 | |
| Interactive Task Learning | ALFWorld (val_seen) | Pick Success Rate96.7 | 18 | |
| Multi-hop QA | HotpotQA in-domain (test) | Accuracy37.6 | 6 | |
| Multi-hop QA | 2Wiki Out-of-Domain (test) | Accuracy36.6 | 6 | |
| Multi-hop QA | MuSiQue out-of-domain (test) | Accuracy12.7 | 6 | |
| Multi-hop QA | Bamboogle out-of-domain (test) | Accuracy27.2 | 6 | |
| Single-hop QA | TriviaQA out-of-domain (test) | Accuracy60.7 | 5 | |
| Single-hop QA | NQ in-domain (test) | Accuracy43.7 | 5 |