Skip to content

COPC: Coupled Off-Policy Correction for Asynchronous LLM Reinforcement Learning

Oct 2026 · 0 citations · 35 references
Computer Science

TL;DR

COPC is introduced, an actor--critic method combining token-level ratio masking with two-sided clipped-ratio weighting of TD residuals for return and advantage estimation that achieves the highest reported performance on tool-integrated mathematical reasoning and search, outperforming the strongest reported asynchronous baseline in each setting.

Abstract

Asynchronous RL accelerates large language model post-training by decoupling rollout generation from optimization, but trains on stale trajectories. Existing methods primarily correct token-level policy mismatch through importance-ratio control in the actor objective. We show that this \emph{policy-side correction} alone is insufficient: advantage estimates also inherit mismatch from behavior-policy continuations, which we term \emph{advantage staleness}. We derive exact bias and variance decompositions for a general two-channel actor update, revealing nonseparable coupling between policy-weight and advantage-estimation errors: their interaction induces multiplicative bias terms, while squared policy weights amplify advantage uncertainty in gradient variance. This motivates the hypothesis that policy- and advantage-side correction should be coordinated. We introduce Coupled Off-Policy Correction (COPC), an actor--critic method combining token-level ratio masking with two-sided clipped-ratio weighting of TD residuals for return and advantage estimation. Joint parameter sweeps across staleness levels support this hypothesis: the effect of one correction parameter depends on, and can reverse with, the other. COPC achieves the highest reported performance on tool-integrated mathematical reasoning and search, outperforming the strongest reported asynchronous baseline in each setting. It also offers a broad high-performing parameter region and improved training stability. In search, COPC remains stable throughout training, while most evaluated asynchronous baselines collapse late in training. These gains persist at 64-step policy staleness. COPC adds minimal step-time overhead over asynchronous PPO and retains a $1.7\times$ step-time speedup over synchronous PPO.

View source

Similar papers

#machine learning Preprint Oct 2026

Enabling Token-wise Importance Sampling in Off-Policy RLVR with Proximal KL Regularization

Off-policy data in reinforcement learning with verifiable rewards (RLVR) can arise from asynchronous generation, rollout-training mismatch, and response reuse. Token-wise importance weighting avoids multiplying likelihood ratios across a response but generally biases policy gradients. We prove that, under coverage and...

Hao Bai, Jiarui Yao, Tong Zhang · 0 citations
#artificial intelligence Preprint Sep 2026

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

BRACE is proposed, an anchored Bellman-residual correction for stale value models that 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.

Guan-Qun Zhao, Zi-Jun Xie, Bin-Bin Zheng et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Asynchronous LLM Post-Training: Group-Mass Capping and Convergence Analysis

Asynchronous reinforcement learning (RL) improves the efficiency of large language model post-training but introduces stale rollouts generated by earlier policies. Theoretical understanding of how this staleness affects convergence and how to mitigate its impact remains limited. We derive a convergence bound for GRPO-s...

Qi-Jia He, Rui-Nan Jin, Jun Luo et al. · 0 citations
#machine learning Preprint Sep 2026

Score Centering Stabilizes Off-policy Reinforcement Learning

It is shown that the instability of RL under TIM is primarily caused by drift: a persistent bias between training and inference engines that accumulates with every training step, and an additive score centering term is derived that stabilizes RL under TIM by canceling drift.

Martina Marek, Max Ryabinin · 4 citations · ⚡1
#machine learning Preprint Oct 2026

Gibbs-Gap Policy Optimization for Off-Policy RL with Verifiable Rewards

Reinforcement learning with verifiable rewards often trains language models on responses generated by a different, possibly stale behavior policy. Correcting this mismatch with learner-to-behavior importance weights can introduce high variance for long responses. We introduce Gibbs-Gap Policy Optimization (GGPO), which...

Xuan-Chang Zhang, Tong Zhang · 0 citations
#artificial intelligence Preprint Oct 2026

CARM: Cancellation-Aware Response Masking for LLM Reinforcement Learning

Recent years have witnessed the rapid adoption of reinforcement learning (RL) in large language model (LLM) post-training, with substantial gains in mathematical reasoning and code generation. In practical systems, however, policy updates and differences between rollout and training engines can make sampled responses o...

Ya-Fei Zhang, Song-Shuo Lu, Si-Cong Liao et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.