ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
0
Citations
0
Influential Citations
—
Venue
2026
Year
On-policy (Self-)Distillation (OPD / OPSD) has shown strong potential for post-training large language models (LLMs). However, existing methods still rely heavily on external supervision, including ground-truth signals, environmental feedback, or guidance from larger models, and therefore fall short of genuine "self"-distillation. In this study, we show that on-policy self-distillation can be achieved using only a model's own generations via internal consistency. We propose unsupervised on-policy self-distillation (U-OPSD). U-OPSD first samples multiple rollouts and constructs a pseudo solution by majority vote under a self-consistency threshold. It then conditions the model's distribution on the pseudo-solution and distills itself on the disagreeing completions, allowing the model to correct itself precisely where it is confidently wrong. Across diverse benchmarks, base models, and training settings, U-OPSD consistently improves over the base models and matches or surpasses supervised methods with ground truth (GT) such as OPSD and GRPO. On five mathematical reasoning benchmarks, i.e., AIME24, AIME25, HMMT25, MATH500, and AMC23, U-OPSD improves over the base model by 8.5% and 10.7% on Qwen3 non-thinking mode at 4B and 8B scales, and outperforms OPSD by 3.2% and 2.3% on average, respectively. In thinking mode, U-OPSD stays on par with OPSD, ahead by 0.9% at 4B and level at 8B and surpassing GRPO by 0.7% and 1.1%, respectively. Code is available at [https://github.com/williamium3000/u-opsd](https://github.com/williamium3000/u-opsd).
This paper addresses a critical bottleneck in post-training large language models (LLMs): the heavy reliance on external supervision. Traditional methods like OPSD and GRPO require ground-truth labels, environmental feedback, or guidance from larger models, which are expensive and not always available. U-OPSD demonstrates that a model can improve itself using only its own generations, leveraging internal consistency. This is a significant step toward truly autonomous self-improvement, which is essential for scaling AI capabilities without human annotation.
The idea of using majority voting to create pseudo-labels is not new, but applying it in an on-policy distillation framework with a self-consistency threshold is novel. The paper shows that by focusing on disagreeing completions, the model can correct its own errors precisely, leading to substantial gains on mathematical reasoning benchmarks. This could have broad implications for other domains where supervision is scarce.
U-OPSD consistently improves over base models. On Qwen3 non-thinking mode, it achieves 8.5% and 10.7% average improvement over the base at 4B and 8B scales, respectively. It also outperforms supervised OPSD by 3.2% and 2.3% on average. In thinking mode, U-OPSD matches OPSD (ahead by 0.9% at 4B, level at 8B) and surpasses GRPO by 0.7% and 1.1%. These results are across five challenging mathematical reasoning benchmarks (AIME24, AIME25, HMMT25, MATH500, AMC23), indicating robustness.
The broader impact of U-OPSD is profound. It suggests that LLMs can self-improve without external feedback, which could reduce the cost and effort of post-training. This is particularly relevant for specialized domains where ground-truth labels are hard to obtain. The method's simplicity and effectiveness could make it a standard tool for autonomous model refinement. However, the reliance on majority voting may not generalize to tasks with high variance or open-ended generation, and the computational cost of multiple rollouts is a practical concern. Future work could explore adaptive thresholds and more efficient sampling strategies.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba