Comparative performance of fully asynchronous versus backward-synchronized policy gradient methods
Determine whether fully asynchronous policy gradient algorithms with decoupled training and data collection outperform backward-pass-synchronized methods under a fixed compute budget, accounting for policy lag effects.
References
This makes it unclear whether fully asynchronous methods outperform approaches that do synchronize the backward pass, given a fixed compute budget.
Consequently, it remains unclear whether such techniques can translate algorithmic improvements into meaningful end-to-end training performance gains in LLM RL.
Scaling toward actual production raises a further question: how can multi-session optimization remain reliable under asynchronous sampling and policy staleness? SAO explores asynchronous optimization with one rollout per prompt, using a learned value model \citep{hou2026singlerolloutasynchronousoptimizationagentic}. However, critic-free, group-relative optimization requires further investigation into when and how rollout groups are formed, how stale samples are handled, and how collected trajectories can be reused.