analiza aiqbench
This arXiv paper proposes Advantage Guidance, a way to get reinforcement-learning-like performance from a supervised learning objective that conditions on future rewards or advantages, combined with contrastive diffusion guidance at sampling time. The authors report gains over prior RL methods on 26 long-horizon, sparse-reward tasks, but these are preprint results on benchmark tasks and have not been independently validated. For practitioners, the appeal is the stability of supervised training as an alternative to RL's hyperparameter sensitivity.
Reinforcement Learning via Advantage Guidance
arXiv:2610.19783v1 Announce Type: new Abstract: Reinforcement learning (RL) holds the promise of learning a policy that can outperform what is shown in the data. However, in practice, such systems suffer from instability and hyperparameter sensitivity. In contrast, supervised learning provides a stable and scalable training objective, but is fundamentally limited by the quality of the demonstrated behavior. In this paper, we ask whether we can perform policy optimization with something as simple and stable as supervised learning but as performant as RL. Unfortunately, naively training the policy with supervised learning and conditioning on future rewards or advantages typically underperform dedicated RL methods. We introduce a new policy extraction method, Advantage Guidance, that retains the simple supervised learning structure with advantage conditioning while outperforming prior RL methods through effective conditional training and contrastive diffusion guidance during sampling. We show that Advantage Guidance can significantly improve a model's ability to respond to conditional advantage signals, and the contrastive guidance during sampling can use the learned advantage-conditioned policy to target the KL-regularized optimal policy. Empirically, we find that Advantage Guidance significantly outperforms prior state-of-the-art RL methods on 26 long-horizon, sparse reward tasks across datasets with varying degrees of optimality.
Abstract:Reinforcement learning (RL) holds the promise of learning a policy that can outperform what is shown in the data. However, in practice, such systems suffer from instability and hyperparameter sensitivity. In contrast, supervised learning provides a stable and scalable training objective, but is fundamentally limited by the quality of the demonstrated behavior. In this paper, we ask whether we can perform policy optimization with something as simple and stable as supervised learning but as performant as RL. Unfortunately, naively training the policy with supervised learning and conditioning on future rewards or advantages typically underperform dedicated RL methods. We introduce a new policy extraction method, Advantage Guidance, that retains the simple supervised learning structure with advantage conditioning while outperforming prior RL methods through effective conditional training and contrastive diffusion guidance during sampling. We show that Advantage Guidance can significantly improve a model's ability to respond to conditional advantage signals, and the contrastive guidance during sampling can use the learned advantage-conditioned policy to target the KL-regularized optimal policy. Empirically, we find that Advantage Guidance significantly outperforms prior state-of-the-art RL methods on 26 long-horizon, sparse reward tasks across datasets with varying degrees of optimality.
Machine Learning (cs.LG)
arXiv:2610.19783 [cs.LG]
(or arXiv:2610.19783v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.19783 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 285 cuvinte
Subiecte conexe
Residual Advantage: Student-Relative Teacher Guidance for RL with Verifiable Rewards
arXiv · 9 oct. 2026
FlowBalance: Verifier-Grounded Self-Improvement from On-Policy Reasoning Experience
arXiv · 5 sept. 2026
Accelerating Reinforcement Learning via MPC Solver-Gradient Guidance for Weights-varying MPC
arXiv · 2 sept. 2026
Tool-Aware Optimization with Entropy Guidance for Efficient Agentic Reinforcement Learning
arXiv · 3 iun. 2026