Score Centering: Eliminating Gradient Drift in RL Training with Additive Correction
Netflix researcher Cameron Wolfe analyzes the Score Centering method proposed by Marek and Ryabinin: In disaggregated RL architectures, probability discrepancies between the sampler and trainer generate a gradient drift term that depends only on the mean reward and carries no information distinguishing success from failure. Score Centering eliminates this drift by subtracting the expected score under the sampler, preserving the learning signal without introducing bias from clipping or masking.
Reinforcement learning (RL) training for large language models (LLMs) typically employs a disaggregated architecture: an inference engine is responsible for generating rollouts, while a training engine computes policy gradients. These components run on different hardware, utilizing distinct precisions, kernels, and batch shapes; consequently, they produce different probabilities for the same token—a phenomenon known as Training-Inference Mismatch (TIM). Asynchronous training further exacerbates this issue, as policy updates may be based on rollouts that are already stale.
The core contribution of Marek and Ryabinin’s paper lies not merely in proposing a correction method, but in providing a deep analysis of why TIM causes instability. They demonstrate that under a constant reward setting, the theoretical policy gradient should be zero (since all actions receive the same reward, there is no learning signal). However, when TIM is introduced, the probabilities of the sampler q and the trainer p no longer cancel out, causing the expected gradient to become non-zero—the trainer begins to mimic the distributional differences of the sampler regardless of whether the reward provides meaningful information. This phenomenon is referred to as gradient drift.
More generally, by decomposing the policy gradient into covariance terms, two parts can be separated: the drift term equals the expected reward multiplied by the expected score of the ratio of sampler to trainer probabilities; the signal term is the covariance between the reward and the score. The drift term does not distinguish between successful and unsuccessful rollouts, relying solely on the mean of the rewards. In online RL, where the sampler is continuously refreshed from the trainer, drift forms a feedback loop: TIM leads to biased updates, which propagate to the sampler, which then produces new biased rollouts—errors accumulate gradually until training collapses.