AgentOPSD: Recursive Self-Distillation for Agentic Reinforcement Learning
Summary
AgentOPSD proposes a critic-free recursive method for turn-level credit assignment in agentic RL, reweighting outcomes via Bayesian belief updates in log-odds space. It achieves 89.1% success on ALFWorld with Qwen2.5-7B, outperforming GRPO and self-distillation baselines.
View Cached Full Text
Cached at: 08/07/26, 05:55 AM
Paper page - AgentOPSD: Recursive Self-Distillation for Agentic Reinforcement Learning
Source: https://huggingface.co/papers/2608.05987 Published on Aug 6
#1 Paper of the day Authors:
,
,
,
,
,
,
,
,
,
,
,
Abstract
Reinforcementlearning(RL)withverifiablerewardsconstructstrajectory-leveladvantageestimates,yetitoftenfailstocreditthefewpivotaldecisionsthatdetermineoutcomesinlong-horizon,multi-turnagentictasks.Recentworkintroducesprivilegedself-distillationforcreditassignment,providingdensersupervision,butitremainsunclearhowsuchlocalsignalsshouldrepresentsequentialcredit.WeproposeAgentOPSD,acritic-free,recursivemethodforturn-levelcreditassignmentinagenticreinforcementlearning.AgentOPSDaggregatestoken-levelteacher-studentlog-probabilitygapsintoturn-levelevidenceandrecursivelyupdatesaBayesianbeliefstateinlog-oddsspace.Thisyieldsaprincipledreweightingschemethatconvertssparseoutcomesupervisionintoturn-levelcreditsignalsandidentifiespivotalturnsthroughthemarginalbeliefrevisionbetweenconsecutivestates.Themethodisfullycompatiblewithstandardpolicyoptimizationandrequiresneitheranadditionalcriticnorextrarollouts.WeevaluateAgentOPSDonALFWorld,WebShop,andSearch-QAusingQwen2.5modelsattwoscales(3Band7B).AgentOPSDoutperformsGRPOandstrongself-distillationbaselines,achieving89.1%successonALFWorldwithQwen2.5-7B.Ablationstudiesattributethegainstoturn-levelaggregationandhistory-dependentrecursivebeliefupdates.
View arXiv pageView PDFGitHub2Add to collection
Get this paper in your agent:
hf papers read 2608\.05987
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2608.05987 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2608.05987 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2608.05987 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
OPID: On-Policy Skill Distillation for Agentic Reinforcement Learning
OPID proposes an on-policy skill distillation framework that extracts dense hindsight supervision from completed trajectories, combining outcome-based RL with token-level self-distillation to improve language agent training efficiency and performance on multi-turn tasks.
PCSD: Persistent Consistency for Self-Distillation in Agentic Reinforcement Learning
PCSD introduces a method for dense token-level supervision in agentic reinforcement learning by using persistent consistency of teacher-favoring signals, improving performance on ALFWorld and WebShop over baselines like GRPO and SDAR.
Self-Distilled Agentic Reinforcement Learning
SDAR enhances multi-turn agent training by integrating self-distillation with a sigmoid gate to selectively strengthen positive token-level guidance while mitigating negative teacher rejections, achieving significant improvements over GRPO across multiple benchmarks.
Progress- and Reliability-Oriented Group Policy Optimization for Agentic Reinforcement Learning
ProGPO is a learned-critic-free method for step-level advantage estimation in group-based RL for LLM agents, using exact-prefix action comparisons and rollout-based state potentials to improve credit assignment on long-horizon tasks. Experiments on ALFWorld and WebShop with Qwen2.5 models show it outperforms existing agentic RL baselines.
PBSD: Privileged Bayesian Self-Distillation for Long-Horizon Credit Assignment
PBSD proposes a Bayesian self-distillation method that converts sparse final rewards into calibrated turn-level credit signals for long-horizon agentic tasks, improving policy learning and generalization.