Yifu Luo, Zeyu Chen, Haoyu Wang, Xinhao Hu, Yuxuan Zhang, Zhizhou Sha, Shiwei Liu
4 min
On-policy self-distillation (OPSD) has become a powerful paradigm for improving Large Language Models (LLMs) by allowing a model to learn from its own generated trajectories. However, existing OPSD methods are designed for autoregressive (AR) models, which rely on left-to-right token generation. Diffusion LLMs (dLLMs) operate differently, generating sequences through an iterative, non-autoregressive denoising process. This fundamental mismatch makes standard AR-centric distillation techniques—which rely on prefix-based conditioning and token-level supervision—incompatible with the architecture of dLLMs.
The authors propose d-OPSD, the first OPSD framework specifically tailored for dLLMs. The approach introduces two key innovations to bridge the gap between AR-based distillation and diffusion-based generation:
Experiments across four reasoning benchmarks (GSM8K, MATH500, Countdown, and Sudoku) demonstrate that d-OPSD consistently outperforms traditional RLVR and SFT baselines. Beyond raw performance, the framework exhibits remarkable sample efficiency, achieving superior results with roughly 10% of the optimization steps required by the diffu-GRPO baseline. This suggests that leveraging 'self-future' information is a highly effective way to drive self-improvement in non-autoregressive language models.
On-policy self-distillation (OPSD) has proven effective for post-training large language models (LLMs), yet its application to diffusion LLMs (dLLMs) remains unexplored. Existing OPSD methods are inherently autoregressive-centric. They inject privileged information via left-to-right prefix conditioning with token-level divergence supervision, a design that fundamentally conflicts with the arbitraryorder generation of dLLMs. We introduce d-OPSD, the first OPSD framework tailored for dLLMs. Our approach makes two core contributions. First, we reframe self-teacher construction by using self-generated answers as suffix conditioning, enabling the student model to learn from "self future-experience" rather than privileged prefixes. Second, we shift supervision from token-level to step-level, aligning training with the iterative denoising process of dLLMs. Experiments across four reasoning benchmarks show that d-OPSD consistently outperforms RLVR and SFT baselines with superior sample efficiency, requiring only around 10% of the optimization steps by RLVR and opening a promising pathway for dLLM posttraining. The code is available at https://github.com/xingzhejun/d-OPSD.
Alex: So by focusing on those successful moments, the model builds a stronger internal map of how to arrive at the right answer.
Sam: Right. And that turns out to be far more efficient than the traditional approach. The usual method for training AI reasoning is called Reinforcement Learning — the model tries things, gets scored, and slowly adjusts over an enormous number of attempts. The paper found that d-OPSD achieved better reasoning performance while requiring only around a tenth of those optimization steps.
Alex: That's a meaningful difference. So what can go wrong?
Sam: The researchers identified a failure mode they call "policy collapse." Imagine an athlete who gets so focused on one narrow technique that they lose the ability to adapt to anything outside that pattern. The model can become too rigid — optimizing so hard for one approach that it forgets how to handle variation.
Alex: And how do they prevent that?
Sam: They use a technique called "pointwise clipping." Think of it like guardrails on a mountain road. It limits how dramatically the model can change its internal settings in any single training step. Without those guardrails, performance can drop off sharply once the model hits its peak. With them, the learning stays stable over time.
Sam: The paper also found that a specific way of measuring how far off the model's reasoning was — without getting into the mathematics — works best when it pushes the model to be more decisive and committed in its choices. That leads to sharper, more consistent reasoning.
Alex: So there's a real balancing act. You want the model to learn aggressively, but if it over-commits to one narrow path, it becomes brittle.
Sam: That's the core tension. The research suggests that if this balance can be maintained over longer training periods, diffusion models could eventually handle much more complex tasks — detailed scientific reasoning, multi-step logic problems — without needing a more powerful model to supervise them.
Alex: It's a meaningful step in how we think about AI training — not just making models bigger, but finding smarter ways for them to learn from themselves. Thanks for walking me through it, Sam.
Sam: Always a pleasure.
Alex: And thanks for listening to ResearchPod.