Abstract
Asynchronous reinforcement learning increases training throughput, but data from stale policies and numerical mismatch between training and inference can destabilize learning. To stabilize off-policy learning, score centering (SC) removes the effect of reward baselines on the expected update. Our gradient diagnostics show less extreme gradients with SC than with importance sampling (IS), but SC can still fail when the learner moves far from the behavior policy that generated the data. To limit this policy mismatch, we introduce Regularized Score Centering (RSC), which adds a reverse Kullback-Leibler (KL) penalty to encourage the learner's next-token distribution to stay close to the behavior policy's next-token distribution. RSC works with or without truncated importance sampling (TIS), which caps token importance weights. Our theoretical analysis supports this approach, showing that KL regularization improves convergence guarantees. We evaluate dense and mixture-of-experts models on mathematical reasoning and agentic tasks, including online shopping, tool use, games, and fully asynchronous software engineering. RSC with TIS substantially improves sample efficiency across all agentic benchmarks, attaining higher training rewards with the same number of sampled responses. In final evaluations, it achieves top performance across all six agentic tasks, improving by 14.3% on AppWorld and reaching 9.9 times the strongest baseline's score on BabyAI.
Community
Asynchronous reinforcement learning increases training throughput, but data from stale
policies and numerical mismatch between training and inference can destabilize learning. To
stabilize off-policy learning, score centering (SC) removes the effect of reward baselines on the
expected update, even without full importance sampling (IS). Our empirical study shows that
full IS produces extreme gradients and that SC significantly reduces their magnitude. However,
SC can still fail when the learner moves far from the behavior policy that generated the data.
To limit this policy mismatch, we introduce Regularized Score Centering (RSC), which adds a
reverse Kullback–Leibler (KL) penalty to encourage the learner’s next-token distribution to stay
close to the behavior policy’s next-token distribution. RSC works with or without truncated
importance sampling (TIS), which caps token importance weights. Our theoretical analysis
supports this approach, showing that KL regularization improves convergence guarantees. We
evaluate dense and mixture-of-experts models on mathematical reasoning and agentic tasks,
including online shopping, tool use, games, and fully asynchronous software engineering. RSC
with TIS substantially improves sample efficiency across all agentic benchmarks, attaining higher
training rewards with the same number of sampled responses. In final evaluations, it achieves
top performance across all six agentic tasks, improving by 14.3% on AppWorld and reaching
9.9× the strongest baseline’s score on BabyAI.
Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper