Papers for

rl algorithm engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Asynchronous reinforcement learning improves with stale critic correction

BRACE: Anchored Bellman-Residual Correction for Stale Critics in Asynchronous RL

Abstract: Asynchronous reinforcement learning has become the standard way to scale training for language models, but the resulting policy lag biases the critic toward the stale behavior policy. Existing work on asynchronous LLM training corrects the actor and leaves this bias unaddressed, while the off-policy value correction of classical RL does not carry over to long-horizon agentic tasks, since a short correction horizon leaves the regression target free of the reward and a long one lets the product of importance ratios drift exponentially with the trajectory length. We propose BRACE, an anchored Bellman-residual correction for stale value models. BRACE bounds the correction horizon to a prefix of policy tokens and anchors a constant-weight Monte-Carlo tail beyond it, which separates policy correction from reward propagation. BRACE improves mean@1 on BrowseComp-Plus by $2.4\%$ over the strongest baseline, runs $2.46\times$ faster per step than synchronous training, and remains stable $50$ updates off-policy.

Wed 9 SeptMachine LearningArtificial Intelligence
The gist
Training language models with asynchronous reinforcement learning can cause delays that make the system's value estimates outdated, leading to less accurate learning. The authors propose a method called BRACE that fixes these outdated value estimates by combining a limited lookahead correction with a steady long-term value estimate. This approach separates adjusting the policy from tracking rewards, making training both faster and more stable. Their tests show that BRACE improves performance on a browsing task while running significantly faster than traditional methods.
Open → 2609.09783v1