LLM Value Functions for Credit Assignment in Agentic RL
AuthorsKaijie Zhu, Weixiang Yan, Omar Attia, Abbas Kazerouni, Alexander Toshev, Andrew Szot
AffiliationsApple
LVRL uses an LLM’s value estimates to identify which actions help or hurt an agent, improving learning from sparse rewards.
Key results
Compared with 19.8% for GRPO.
Compared with 12.0% for GRPO.
LVRL performance; baseline methods are near zero.
LVRL performance on longer navigation tasks.
Share of Monte-Carlo-labeled pitfalls with correctly signed predicted value changes.
What the paper found
LLM Value Function RL, or LVRL, addresses sparse-reward credit assignment by using a frozen LLM to score states in completed agent trajectories, then assigning each action the change in estimated value. The critic is calibrated with same-task rollouts from the current policy, while anchoring the first and final state values to observed group success and episode reward; this preserves the trajectory’s total outcome signal while distributing credit across steps, without training a separate critic. Using Claude Opus 4.6 as the value critic, the method improves Qwen3 policies across AppWorld, BabyAI, and SWE-bench Verified: Qwen3-8B reaches 26.3% on AppWorld versus 19.8% with GRPO, and 20.2% on SWE-bench Verified versus 12.0%. On BabyAI, where baseline success is near zero, LVRL reaches 75.0% in-distribution and 65.5% out-of-distribution. The authors also introduce LVOPD, which applies teacher distillation only to actions whose estimated value decreases; on AppWorld, Qwen3-4B reaches 20.2% success versus 17.0% with standard distillation. Monte-Carlo checks find that the critic’s value changes identify 72% of critical pitfalls and 66% of recoveries, though results depend on critic capability and value estimation adds inference cost.
Original abstract
Reinforcement learning (RL) for large language model (LLM) agents remains challenging in long-horizon tasks with sparse outcome rewards, where assigning credit to individual actions is difficult. Methods such as GRPO assign the same trajectory-level advantage to all actions, while critic-based methods require learning an additional value function that can be costly and unstable. We introduce LLM Value Function RL (LVRL), which uses the pretrained knowledge and in-context learning ability of an LLM to estimate policy-aware state values without finetuning a separate critic. LVRL conditions the value model on group context and calibrates its predictions using known values at the initial and terminal states, enabling step-level credit assignment from estimated value differences. We further extend this idea to learning from an expert policy through on-policy distillation (OPD), introducing LLM Value Function OPD (LVOPD), which focuses teacher supervision on actions associated with decreases in estimated value. We evaluate our approach across diverse agentic benchmarks: AppWorld, BabyAI, and SWE-bench Verified. Across policy scales (4B to 32B), LVRL consistently and substantially outperforms both GRPO and PPO. On AppWorld and SWE-bench Verified, LVRL yields absolute improvements of up to 13.6 and 8.6 percentage points over GRPO. Notably, on tasks requiring extended exploration like BabyAI, LVRL bridges the gap from total failure to 75.0% success. Furthermore, LVOPD yields consistent improvements over standard distillation baselines on AppWorld. Finally, Monte-Carlo analysis confirms that our frozen critic accurately identifies semantic pitfalls and recoveries, proving that LVRL extracts robust, policy-aware step-level credit from sparse terminal outcomes.
Read the original paperMore in Reinforcement Learning
Browse all 63 papers →Enabling Token-wise Importance Sampling in Off-Policy RLVR with Proximal KL Regularization
Hao Bai, Jiarui Yao, Tong Zhang
A new proximal-KL approach makes token-wise off-policy learning more stable for training language models with verifiable rewards.
MagicBeanStalk: Escaping the RLVR Zero Advantage Trap with Recursive Data Synthesis
Ximing Lu, Aviral Kumar, Jan Kautz, Yejin Choi, David Acuna
MagicBeanStalk recursively creates calibrated reasoning problems that help RL-trained models learn more effectively than simply scaling or filtering existing data.
On KL-Regularized Policy Optimization
Yifan Zhang
KLPO offers a cheaper, critic-free way to train asynchronous language-model agents from stale rollouts by using the sampler itself as the KL reference.