Gated-BEPO: Confidence-Gated Bellman Credit Assignment for Large Language Model Agents
Hongxi Yan, Ziyue Huang, Shichao Fan, Qingjie Liu
cs.AI
Submitted: 2026-08-07
Updated: 2026-08-10
Code: https://github.com/Y-Claw/Gated-BEPO
License: http://creativecommons.org/licenses/by/4.0/
The gist: Training large language model agents in long-horizon environments requires assigning credit from sparse terminal outcomes to individual actions.
Terminology
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.
Sources
- Reinforcement Learning for Long-Horizon Interactive LLM Agents
- VinePPO: Refining Credit Assignment in RL Training of LLMs
- Agent Lightning: Train ANY AI Agents with Reinforcement Learning
- Large Language Models Can Self-Improve At Web Agent Tasks
- Qwen2.5 Technical Report
- Proximal Policy Optimization Algorithms
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- Hindsight Credit Assignment for Long-Horizon LLM Agents
- Reinforcing Multi-Turn Reasoning in LLM Agents via Turn-Level Reward Design
- From Reasoning to Agentic: Credit Assignment in Reinforcement Learning for Large Language Models
- GAGPO: Generalized Advantage Grouped Policy Optimization
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems
- VSAL: A Vision Solver with Adaptive Layouts for Graph Property Detection