Under smoothness assumptions, stale rollouts in async GRPO bias the surrogate gradient by O(S * eta) and yield the stability bound eta << min(R_batch / (S * G_upd), R_crit / (T * G_upd)).
arXiv preprint arXiv:2310.00036 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Staleness-Learning Rate Scaling Laws for Asynchronous RLHF
Under smoothness assumptions, stale rollouts in async GRPO bias the surrogate gradient by O(S * eta) and yield the stability bound eta << min(R_batch / (S * G_upd), R_crit / (T * G_upd)).