Online Draft Co-Training for Speculative Decoding in Large-Scale, Long-Context RL Post-Training

Zili Wang, Zhaopeng Qiu, Yuekai Zhang, Shuang Yu, Junjie Lai

NVIDIA

Published September 7, 2026 · on the feed September 9, 2026 · ▲ 35 · arXiv 2609.07108

LLM training & RLEfficiency & inference Full code arXiv ↗Hugging Face ↗

The abstract

Speculative decoding accelerates rollout generation, which dominates the cost of reinforcement learning (RL) post-training. Online co-training can further increase the draft's accuracy, yielding greater speedups. However, scaling this approach to co-training on large models with long contexts poses two obstacles: (1) branch attention is unsupported by standard causal context-parallel (CP) implementations, and (2) target features span across pipeline-parallel (PP) stages. We address both with an end-to-end system for large-scale online draft co-training. For CP, we extend packed, load-balanced zigzag ring attention by merging rank-local branch attention with causal main-sequence attention. For PP, TapChannel transports intermediate target features across stages via a separate path, leaving the pipeline schedule unaffected. Experiments demonstrate that co-trained drafts closely track the policy baseline while delivering substantial rollout and end-to-end speedups across model scales up to 122B. Our CP design achieves strong scaling at 256K tokens with significant memory savings over prior work, and our PP transport incurs modest overhead. Code can be found at https://github.com/NVIDIA-NeMo/RL/issues/3698.

The Brief

2:17

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Online Draft Co-Training for Speculative Decoding in Large-Scale, Long-Context RL Post-Training. By Zili Wang and four others, from NVIDIA. Published on the seventh of September. Its code repository is worked out: about one thousand five hundred source files, with a readme and a licence.

In reinforcement-learning post-training, generating rollouts dominates the cost. Speculative decoding speeds that generation up, and co-training the draft model online, alongside the policy, makes the draft more accurate and the speedups larger. Accuracy in the draft is what converts into speed. Scaling online co-training to large models with long contexts runs into two obstacles. Branch attention is not supported by standard causal context- parallel, or CP, implementations. And the target features the draft needs are spread across pipeline-parallel, or PP, stages. Both are the parallelism schemes that large, long-context training relies on, so the co-training has to work within them rather than around them.

The authors address both with an end-to-end system for large-scale online draft co-training. Each obstacle gets its own fix, one for context parallelism and one for pipeline parallelism.

For context parallelism, they extend packed, load-balanced zigzag ring attention by merging rank-local branch attention with the causal attention over the main sequence. For pipeline parallelism, a component called TapChannel carries intermediate target features across stages along a separate path, so the pipeline schedule itself is left untouched. The features reach the draft without the pipeline having to be rearranged to deliver them.

Co-trained drafts closely track the policy baseline, and they deliver substantial speedups, both in rollouts and end to end, across model scales up to one hundred and twenty-two billion parameters. The CP design scales strongly at two hundred and fifty-six thousand tokens, with significant memory savings over prior work. The PP transport adds only modest overhead. Tracking the policy baseline closely is the condition that matters: speed gained from the draft should not come at the cost of what the training produces.

Neither fix changes what co-training is. They make it fit inside the parallelism that large, long-context training already depends on: attention merged into the existing ring scheme, and features moved beside the pipeline rather than through it. Code is linked from the NVIDIA-NeMo repository.

Paper Quest · 7 chapters · about 41 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Every quest starts with a wall. Here it is a fast idea that does not fit a big machine.

You speed up RL training rollouts with a small draft model that guesses tokens for the big policy to check. Training the draft alongside the changing policy keeps its guesses good.

The road ahead

  1. 1 · The problem ~7 min A small draft model trained alongside a huge RL policy speeds up rollouts, but the policy's GPU split does not support what the draft needs.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Keep the policy's GPU layout as it is: split the draft's attention into a shared prefix part and a local branch part, and ship features on a side path.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Rollouts use the draft, features travel by side path, attention is computed in two parts and merged, and the draft trains with the policy.
  6. 6 · The experiment ~6 min You’ll guess: With the draft model co-trained online alongside the policy, how did the policy's learning compare with the baseline trained without it?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.