Retroactive Advantage Correction: Closed-Form V-Trace Bias Correction for Delay-Aware RLHF

June 25, 2026 ยท Grace Period ยท ๐Ÿ› the ICML 2026 Workshop on Reinforcement Learning from World Feedback

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Arnav Raj arXiv ID 2606.27580 Category cs.LG: Machine Learning Cross-listed cs.AI Citations 0 Venue the ICML 2026 Workshop on Reinforcement Learning from World Feedback
Abstract
Reinforcement learning from human feedback (RLHF) in production does not always have a synchronous reward signal. Code-execution verifiers, slow judge ensembles, and queued human review can return several gradient steps after the rollout that produced them, breaking the synchronous-reward assumption underlying standard PPO. We address this gap with Retroactive Advantage Correction (RAC): each pending slow completion is queued, aged through a non-negative kernel, and reinjected as a clipped residual into the next optimiser step's advantage. We prove that under an unbiased clipped importance ratio, the cumulative RAC correction is exactly unbiased when the effective delay kernel reinjects all of its mass, and carries a bias linear in the unreinjected fraction otherwise; at the no-delay identity kernel it reduces to V-trace. On a tabular Markov decision process (MDP) proof-of-concept, RAC reduces the closed-form policy bias by up to 47.9x at the two-slow-channel configuration, beating wait-for-slow at lower wall-clock cost. RAC integrates with PPO and GRPO through a two-line reward-manager patch.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning