Weak-to-Strong Generalization via Direct On-Policy Distillation
arXiv · HuggingFace · ▲131
Abstract (verbatim)
Reinforcement learning with verifiable rewards (RLVR) is a powerful recipe for improving language-model reasoning, but it is expensive to repeat on every new strong model because the target model must generate many rollouts during training. As models scale, post-training itself becomes a bottleneck. We study a weak-to-strong alternative: run RL on a smaller model where rollouts are cheaper, then reuse what that RL run learned to improve a stronger target model. Directly distilling the post-RL weak teacher is not enough, because the teacher's final policy mixes useful RL gains with the limitations of the smaller model. We propose Direct On-Policy Distillation (Direct-OPD), which transfers the teacher's RL-induced policy shift instead. Direct-OPD compares the post-RL teacher with its own pre-RL reference and treats their log-ratio as a dense implicit reward for the student. In plain terms, the checkpoint pair tells us which actions RL made the weak model more or less likely to take, and Direct-OPD applies that signal on the stronger student's own on-policy states. This directly reuses the weak model's RL supervision signal without running sparse-reward RL on the target model. Empirically, Direct-OPD consistently leverages weaker teachers to improve stronger target models; notably, it boosts Qwen3-1.7B from 48.3% to 58.3% on AIME 2024 in just 4 hours on 8 A100 GPUs. It outperforms step-matched direct RL and enables the sequential composition of multiple policy shifts. Our results show that RL outcomes can be reused across model scales as implicit reward signals, not merely as final models to imitate.
Background
Background Analysis
1. Technical Context and Need
Recently, reinforcement learning with verifiable rewards (RLVR) has become a dominant method for enhancing reasoning in large language models (e.g., DeepSeek-R1, JustRL). The core idea is to train models by generating behaviors (rollouts), receiving feedback, and optimizing policies in an environment. However, this approach faces a significant bottleneck: larger models are more computationally expensive to train—generating behaviors slows down, and each RL iteration becomes costlier. As models scale, retraining RLVR from scratch for every new strong model becomes impractical, creating a need for more efficient post-training methods.
2. Limitations of Previous Methods
Traditional approaches directly imitate the final policy of a weak model (e.g., "policy distillation"), but this has fundamental flaws: the weak model’s final policy mixes useful improvements from RL with its inherent limitations. For example, when the target model (student) is already stronger than the weak model, imitating the weak model’s policy may overwrite the student’s superior behaviors (as shown in Figure 1(a), where a strong model is dragged down by the weak model’s policy). Additionally, running RL directly on strong models is expensive, and existing methods cannot reuse the supervisory signals learned during the weak model’s RL training.
3. Proposed Solution
The paper introduces "Direct On-Policy Distillation (Direct-OPD)," which focuses on transferring the "policy shift" induced by RL in the weak model, rather than the weak model itself. Specifically, by comparing the weak model’s behavior before and after RL training (i.e., "policy shift"), it extracts the supervisory signal from RL’s modifications and applies this signal as an implicit reward to train a stronger model (student). This avoids rerunning RL on the strong model while preserving the effective supervision from the weak model’s RL training. Experiments show that this method significantly improves strong models’ performance (e.g., Qwen3-1.7B’s score on AIME 2024 rises from 48.3% to 58.3%) with only a fraction of the cost of direct RL.
4. Key Differences from Prior Work
Unlike traditional policy distillation, Direct-OPD does not rely on the weak model’s final policy but focuses on the "policy shift," a more essential supervisory signal. Additionally, it does not require explicit reward model training or high overlap between the weak and strong models, enabling effective transfer across scales and reasoning patterns. This approach transforms RL’s outcomes from "single-model optimization" to "reusable cross-scale signals," offering a new direction for efficient post-training of large models.













