Experiments on WebShop, ALFWorld, and visual Sokoban show consistent improvements across language and vision-language models, while diagnostic ablations support the effectiveness of Bellman fixed-point value estimation and show that step-level credit should be incorporated selectively rather than uniformly into the final advantage.
Abstract
Training large language model agents in long-horizon environments requires assigning credit from sparse terminal outcomes to individual actions. Existing critic-free methods propagate trajectory-level rewards uniformly across steps, while recent approaches construct step-level groups by matching repeated states and compare actions within each group. The former cannot distinguish useful actions in failed trajectories from ineffective actions in successful ones. The latter rely on step credit derived directly from individual trajectory outcomes and fixed-weight fusion with episode-level credit. We propose Gated-BEPO, which derives step-level credit from empirical rollout graphs. For each rollout group, Gated-BEPO constructs an empirical graph and estimates node values through a mean-backup Bellman fixed point that reflects the empirical action distribution of the current policy. We then accumulate these temporal-difference residuals along each sampled trajectory using generalized advantage estimation, yielding step-level Bellman advantages that capture both immediate and downstream effects. To adaptively fuse episode- and step-level credit, a confidence gate incorporates Bellman credit only at states with multiple observed successors and otherwise uses episode-level credit. Experiments on WebShop, ALFWorld, and visual Sokoban show consistent improvements across language and vision-language models, while diagnostic ablations support the effectiveness of Bellman fixed-point value estimation and show that step-level credit should be incorporated selectively rather than uniformly into the final advantage.
Transition-wise Rubric Credit Assignment (TRCA) is proposed, which derives step-level supervision directly from action-induced transitions without learned evaluators or successful anchors for long-horizon tasks with sparse successful anchors.
Huan-Xi Zhang, Ming-Ju Chen, Dongxu Zhou et al.· 7 citations
Influence-Aware Policy Optimization (IAPO), which represents each rollout as a typed influence-dependency graph over trainable agent actions, with user and tool observations serving as evidence, is introduced and advances the understanding of credit assignment in multi-turn user interactions.
It is argued that the right resolution is state-dependent, and GACA, a critic-free estimator whose granularity follows an uncertainty-based criticality proxy is proposed, improves task success over GRPO and GiGPO at both 1.5B and 7B scales.
Tao Liang, Yang Liu, Shang Luo et al.· 2 citations
MileGPO (Milestone Inference with Local Evidence for Graph-Based Policy Optimization) is proposed, which derives process-level credit from grouped on-policy rollouts through three designs and indicates that reliability weighting, local progress, and same-state branch evidence complement milestone discovery and resolve...
Bo Qian, Yuting Wu, Shuang Zeng et al.· 1 citation
A unified temporal-credit view of token-level OPD and sequence-level OPD is established, showing that practical token-level OPD can be interpreted as a temporal approximation to the sequence-level reverse-KL gradient.
Shi-Qi Liu, Ze-Yu He, Le-Tian Tao et al.· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.