Negative Self-Distillation: Learning to Reason by Avoiding Flaws
Rongcan Pei, Zhepei Wei, Shuyao Xu, Xinyu Zhu, Wei-Lin Chen, Yu Meng
University of Virginia · Stanford University
Published September 10, 2026 · on the feed September 11, 2026 · ▲ 33 · arXiv 2609.11699
The abstract
On-Policy Self-Distillation (OPSD) has emerged as a popular paradigm for large language model (LLM) self-improvement, allowing models to act as their own teachers by leveraging privileged information such as ground-truth solutions. However, recent findings indicate that OPSD can severely degrade the performance of LLMs on complex reasoning tasks: By forcing the student to imitate an artificially confident reasoning trace conditioned on privileged information, OPSD inadvertently suppresses expressions of uncertainty and penalizes the exploratory, self-corrective behaviors required to solve challenging problems. To address this, we introduce Negative Self-Distillation (NSD), a new framework that optimizes LLMs by diverging from flawed reasoning rather than imitating privileged solutions. Instead of relying on ground-truth answers or external supervision, NSD uses the model itself to generate a question-specific negative condition (eg, acting as a ``careless reasoner'') and pushes the student's distribution away from this self-generated negative teacher. Naively applying unlearning objectives to achieve this divergence is problematic, as flawed reasoning tokens are confounded with basic linguistic tokens; indiscriminately penalizing both risks catastrophically degrading the model's foundational language capabilities. We resolve this by designing a dynamic gating mechanism that automatically identifies and isolates reasoning-critical tokens, ensuring gradient updates target only behavioral flaws while preserving the model's linguistic priors. Empirically, NSD consistently outperforms OPSD and other label-free, self-bootstrapping reinforcement learning (RL) baselines.
The Brief
2:56A short podcast summary of the paper. Written and voiced by AI.
Transcript
Negative Self-Distillation. Learning to Reason by Avoiding Flaws. By Rongcan Pei and five others, from the University of Virginia and Stanford University. Published on the tenth of September. Its code repository is worked out: about six hundred and fifty source files, with a readme.
On-Policy Self-Distillation, OPSD, has become a popular way for large language models to improve themselves. The model acts as its own teacher, drawing on privileged information such as ground-truth solutions. But recent findings indicate that OPSD can severely degrade performance on complex reasoning. The student is forced to imitate a reasoning trace that is artificially confident, because it was produced with the answer in view. In doing so, OPSD suppresses expressions of uncertainty, and penalizes the exploratory, self-correcting behaviour that hard problems require. The irony is that the method meant to help the model learn from correct answers ends up discouraging the very habits, hesitation, checking, trying again, that produce correct answers on hard problems.
Negative Self-Distillation, NSD, turns the direction around. Instead of imitating a privileged solution, the model is optimized to diverge from flawed reasoning. It needs neither ground-truth answers nor external supervision. The model itself generates a negative condition specific to each question, for example acting as a careless reasoner. The student's distribution is then pushed away from this self-generated negative teacher. The negative teacher is still the model itself. The only difference is the condition it is put under, so the supervision costs nothing beyond the model that is already being trained. Where OPSD says, reason like someone who knows the answer, NSD says, do not reason like someone who is careless.
Achieving that divergence naively, with standard unlearning objectives, runs into trouble. Tokens that carry flawed reasoning are confounded with ordinary linguistic tokens. Penalizing both indiscriminately risks catastrophic damage to the model's basic language abilities: pushing away from a careless reasoner could mean pushing away from grammar too.
The fix is a dynamic gating mechanism. It automatically identifies and isolates the tokens critical to reasoning, so that gradient updates target only the behavioural flaws, and the model's linguistic priors are preserved. The result is a narrow push rather than a broad one. The model is moved away from the careless reasoner's choices only at the points where those choices are about reasoning.
In experiments, NSD consistently outperforms OPSD, and it also beats other label-free, self-bootstrapping reinforcement learning baselines. That comparison is the fair one, since NSD, like those baselines, improves a model without relying on labelled answers.
The argument runs in two steps. Imitating a confident teacher who has seen the answer teaches a model to stop doubting, which is exactly what hard reasoning needs it to keep doing. Learning what not to do, from its own careless alter ego, avoids that, provided the push away is aimed only at the reasoning and not at the language that carries it.
Paper Quest · 7 chapters · about 40 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
Self-teaching was meant to help. Instead, it taught the model to stop doubting itself.
You want a language model to get better at hard maths reasoning without labelled answers or a stronger outside teacher. A popular trick lets the model teach itself, with the correct solution shown to its teacher copy.
The road ahead
- 1 · The problem ~7 min Letting a model teach itself with the answer in view makes its teacher copy overconfident, and copying that confidence kills the checking hard maths needs.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Instead of copying a teacher who knows the answer, the model plays a flawed reasoner and the student learns to move away from it, only on reasoning tokens.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Write a flaw prompt, score the student's tokens with a flawed and a plain copy, gate on the gap, and push the student away there.
- 6 · The experiment ~6 min You’ll guess: Trained with no labelled answers, how did the new method compare with OPSD and label-free reinforcement learning baselines?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.