INQUIRING LINE

Should an AI learn only from problems where its own answers disagree, or from everything it writes?

How does distilling only inconsistent rollouts compare to distilling all generations?

This explores whether a model learns better when self-distillation trains only on the questions where its own attempts disagree, compared with training on everything it generates.


This explores whether a model learns better when self-distillation trains only on the questions where its own attempts disagree, compared with training on everything it generates. The library has one note on the selective approach, Can a model's own consensus replace ground truth labels?, and it doesn't include a head-to-head test against distilling all generations. That note reports that unsupervised on-policy self-distillation matched or beat supervised methods on five benchmarks. It gets there by distilling only on self-inconsistent rollouts, using the model's majority-vote agreement as the teaching signal instead of ground-truth labels. Nothing in the library shows what happens if you distill on the consistent rollouts too, so anything beyond that is inference from neighboring notes.

The standard alternative is on-policy distillation over everything: the student generates sequences and a teacher scores all of them, as in Can distillation work on the student's own generated sequences?. That approach fixes the mismatch between training and real use, but it treats every generation as equally worth learning from. A neighboring finding suggests why that may be wasteful: Does on-policy distillation actually expand student capability? says this kind of distillation mostly steers a student toward correct paths it can already reach, and that signal quality and diversity matter more than teacher size. If the job is choosing between reasoning paths the model can already produce, the questions where its samples split are where the choice exists. Where every sample agrees, there is little left to steer.

The selective version also sidesteps two problems that appear in the library's other distillation notes. Does richer teacher context hurt student generalization? shows that a teacher given the answer produces confident, concise traces, and students inherit that confidence, which hurts them on out-of-distribution problems that call for caution. A model teaching itself through majority vote has no all-knowing teacher to copy, and the training concentrates on the spots where it was actually uncertain. Separately, Can proximity between teacher and student fix distillation instability? finds that distillation destabilizes when the teacher is far from the student. A teacher built from the student's own consensus is about as close as a teacher can be, though the library doesn't test that link.

The main risk for the selective approach is that agreement is not the same as being right. Does setting temperature to zero actually make LLM outputs reliable? makes a related point about repeated outputs: consistency can just mean the same draw came out again. A model that is consistently wrong on a question would be skipped entirely, and its errors would never be corrected. Majority vote also assumes the most common answer among inconsistent rollouts is the better one. The five-benchmark result suggests that assumption held there, but it isn't proof it holds everywhere.

A related idea shows up in agent training. Can tree structure alone convert outcome rewards into process supervision? gets step-level supervision by comparing sibling branches of the same rollout tree, so the signal again comes from samples that diverge. The pattern across these notes is that disagreement between a model's own samples is treated as the informative part. Whether that beats using every generation is the open question, and the library doesn't answer it.


Sources 7 notes

Can a model's own consensus replace ground truth labels?

Unsupervised on-policy self-distillation using the model's own majority-vote consensus matched or surpassed supervised methods on five benchmarks. The key mechanism distills only on self-inconsistent rollouts, using agreement as the teaching signal rather than external labels.

Can distillation work on the student's own generated sequences?

Generalized Knowledge Distillation (GKD) fixes the train-inference mismatch by having students generate sequences that the teacher then scores, aligning the training distribution with the student's actual inference behavior. This on-policy approach also composes cleanly with RL fine-tuning.

Does on-policy distillation actually expand student capability?

On-policy distillation steers students toward correct reasoning paths within their existing capability envelope rather than raising the ceiling. Signal quality and diversity matter far more than teacher scale; a smaller teacher with high-fidelity guidance outperforms larger teachers without it.

Does richer teacher context hurt student generalization?

Teachers conditioned on correct answers and verifier output produce confident, concise traces that students inherit. This style suppresses uncertainty expression, optimizing in-domain performance while degrading generalization to out-of-distribution problems that require epistemic caution.

Can proximity between teacher and student fix distillation instability?

TOP-D constructs a close teacher instead of distilling from a distant target, bounded by a trust region. This controls gradient variance, guarantees monotonic improvement, and outperforms standard distillation with zero computational overhead.

Show all 7 sources
Does setting temperature to zero actually make LLM outputs reliable?

Fixed seeds and zero temperature replicate the same output repeatedly, but that output remains one draw from the model's probability distribution. McDonald's omega testing across 100 repetitions reveals that consistency does not equal reliability.

Can tree structure alone convert outcome rewards into process supervision?

Tree-GRPO uses branching structure to transform trajectory-level outcome rewards into step-level preference signals through sibling subtree comparison, eliminating the need for separate process reward models or step-level annotation while scaling with computational budget.

Papers this line draws on 8

The research behind the notes this line reads — ranked by how closely each paper relates.