NVIDIA's Lightning OPD Trains Qwen3-8B 4x Faster Without a Live Teacher
NVIDIA researchers show that on-policy distillation can drop its live teacher server, cutting 8B reasoning training from 120 to 30 GPU hours.
PRO- NVIDIA's Lightning OPD removes the live teacher server from on-policy distillation by precomputing teacher log-probabilities once.
- Achieves 69.9% on AIME 2024 with Qwen3-8B in 30 GPU hours, a 4.0x speedup over standard OPD.
- Identifies teacher consistency (same teacher for SFT and OPD) as a previously overlooked requirement that biases gradients when violated.
- Scales to Qwen3-30B-A3B MoE on a single 8xH100 node, reaching 71.0% AIME 2024 and 60.8% LiveCodeBench v5.
- Proves the offline objective shares standard OPD's optimum and adds implicit regularization against policy drift.
- Code available at github.com/jet-ai-projects/Lightning-OPD; limitations remain for multi-turn and open-ended tasks.
On-policy distillation has quietly become one of the most effective ways to squeeze reasoning capability into smaller language models, but it comes with an ugly bill: you have to keep a giant teacher model running on GPUs the entire time you're training the student. A new paper from NVIDIA argues that most of that infrastructure is unnecessary, provided you obey one condition that almost every published OPD pipeline currently violates.
The framework, called Lightning OPD, precomputes the teacher's per-token log-probabilities once, ahead of training, then trains the student against that fixed cache. Starting from an SFT-initialized Qwen3-8B-Base model, it reaches 69.9% on AIME 2024 in just 30 GPU hours, a 4.0x speedup over standard OPD, while matching accuracy on every benchmark the authors evaluated.
Why the teacher server was the bottleneck
On-policy distillation (OPD) sits between supervised fine-tuning and reinforcement learning. Rather than a sparse pass or fail reward, the student generates its own rollouts and the teacher scores every token, giving a dense per-token advantage signal of the form log pi_T(a_t) - log pi_theta(a_t). This dense token-level KL signal is what makes OPD compute-efficient compared to RL from verifiable rewards, which only provides a sparse trajectory-level reward that scales poorly when most rollouts fail the verifier.
The catch is that the teacher has to be online. Every gradient step, the student produces new rollouts, and a multi-GPU teacher server has to score them on the fly. For an 8B student with a 32B teacher, you end up co-hosting both models, fragmenting your cluster and making experiments painful to reproduce outside of a well-funded lab.
The obvious workaround is to precompute the teacher's log-probabilities once over some fixed rollouts and reuse them. When the authors tried this naively, it broke: the offline variant failed to match standard OPD, and they set out to find out why.
This story is for Pro members
You've reached the end of the free preview. Upgrade to AlphaSignal Pro to read the full article - and everything else behind the paywall.