RELACE: retrospective likelihood-based action credit estimation for long-horizon language agents
On the map: LLM reasoning → Reinforcement learning for reasoning
Abstract (arXiv)
Group Relative Policy Optimization (GRPO) avoids a separate critic by estimating advantages from rollout groups. For multi-turn agents, however, trajectory-level supervision provides coarse, noisy credit: terminal rewards do not locate errors and can penalize useful actions alongside mistakes. Group-in-Group Policy Optimization (GiGPO) and subsequent methods refine supervision through state-conditioned comparisons, but their credit estimates remain sensitive to downstream decisions and outcomes. We introduce RELACE, Retrospective Likelihood-based Action, a critic-free framework that integrates retrospective action assessment with state-conditioned advantage estimation. RELACE evaluates executed actions through teacher-forced likelihood scoring under both their original contexts and outcome-augmented contexts. Comparing these likelihoods yields a trajectory-normalized retrospective factor that captures outcome-dependent changes in action plausibility, rather than hindsight plausibility alone. We use this factor to reweight discounted task returns and construct local advantages by comparing weighted returns among actions from equivalent states within a task. This couples retrospective relevance with observed reward, producing fine-grained credit that complements trajectory-level GRPO supervision. Temporal smoothing and success-protecting masking further stabilize the local signal. RELACE requires neither auxiliary value nor reward models nor additional autoregressive rollouts for credit estimation. Experiments on ALFWorld and WebShop with Qwen2.5-1.5B-Instruct and Qwen2.5-7B-Instruct demonstrate substantial improvements over GRPO, GiGPO, and HCAPO. With the 1.5B model, RELACE achieves 96.35% success on ALFWorld and 79.43% on WebShop, surpassing GiGPO by 5.47 and 5.60 percentage points, respectively.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Reinforcement learning for reasoning, one of 17 directions in LLM reasoning. First posted on arXiv 5 Oct 2026.
Builds on
No reference list yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Progress-conditioned Group Policy Optimization for Long-Horizon Agentic Tasks
- 2026Reinforcement Learning with Decomposed Subtasks
- 2026Gated-BEPO: Confidence-Gated Bellman Credit Assignment for Large Language Model Agents
- 2026Targeting Pivotal Decisions for Credit Assignment in Agentic Reinforcement Learning
- 2026Enhancing LLM-based Search Agents via Contribution Weighted Group Relative Policy Optimization
- 2026From Outcomes to Actions: Leveraging Hindsight for Long-Horizon Language Agent Training
- 2026Tracking the Moving Frontier: Long-Short Term Advantage Estimator
- 2025Reinforced Language Models for Sequential Decision Making