Papers
Topics
Authors
Recent
Search
2000 character limit reached

Purified OPSD: On-Policy Self-Distillation Without Losing How to Think

Published 2 Jul 2026 in cs.AI and cs.LG | (2607.02234v1)

Abstract: On-policy self-distillation (OPSD) has emerged as a promising paradigm for improving LLM reasoning, where a privileged teacher with access to reference solutions provides token-level supervision on the student's own generated trajectories. However, we find that OPSD consistently fails on long chain-of-thought (long-CoT) reasoning models, yielding at best marginal gains while destabilizing the reflective reasoning capability these models depend on. Through a novel decomposition of the teacher's supervision signal, we identify the root cause: the teacher's supervision is dominated by a reference-induced component that drives rote memorization of reference-specific shortcuts, while the question-conditioned, inference-transferable component is ignored or actively opposed. Based on this diagnosis, we propose a two-step solution. First, we construct a reference-only teacher (the same model conditioned on the reference without the question) to isolate the non-transferable component of the supervision signal; the residual after subtracting this component captures the question-conditioned, inference-transferable correction. Second, we use pointwise mutual information (PMI) as the mechanism to transform this residual into a well-formed PMI target distribution that the student can directly distill from, filtering out the reference-induced shortcut. Experiments on four long-CoT models across two datasets demonstrate consistent improvements over both the base model and standard OPSD, while preserving the models' natural epistemic behavior throughout training.

Summary

  • The paper finds that standard on-policy self-distillation degrades question-conditioned reasoning in long chain-of-thought (CoT) models.
  • It introduces a PMI-anchored two-step correction leveraging a reference-only teacher to isolate transferable signals.
  • Experiments show that Purified OPSD improves accuracy and preserves reflective epistemic markers in various reasoning benchmarks.

Purified OPSD: On-Policy Self-Distillation Without Losing How to Think

Introduction

This work systematically diagnoses and addresses a core failure mode of on-policy self-distillation (OPSD) when applied to long chain-of-thought (long-CoT) reasoning models. While OPSD has been successful in aligning compact LMs with reasoning capabilities exhibited in larger teacher models, it exhibits divergent and sometimes pathological behavior on long-CoT models, degrading the reflective, epistemic processes crucial for robust generalization and deliberative reasoning. The analysis leads to a new, theoretically-grounded distillation paradigm, Purified OPSD, informed by pointwise mutual information (PMI), that rectifies these failings without introducing significant computational cost.

Analysis of OPSD Failure in Long-CoT Reasoning

Long-CoT models are distinguished not only by their ability to produce extended, structured reasoning traces but also by their use of epistemic markers—tokens denoting uncertainty and self-reflection (e.g., "Wait", "Let me think", "Perhaps"). These markers serve as signals of generalizable reasoning strategies rather than rote pattern matching. However, empirical analysis reveals that standard OPSD either suppresses these markers or escalates degenerate repetition, fundamentally disrupting the epistemic behavior that underpins generalization.

Quantitative decomposition of the teacher’s update signal demonstrates that the supervision provided by the privileged teacher in OPSD is dominated by a reference-induced component—the portion of the gradient field aligned with the reference answer—but not necessarily with the question or the correct inferential trajectory. This reference-specific shortcut not only fails to support question-conditioned, inference-transferable improvements but actively displaces them, causing the student to overfit to privileged solution heuristics and lose general problem-solving skills. Cosine similarity analysis confirms that the alignment of the teacher’s update with the inference-transferable component is negligible or negative throughout most of training, confirming the dominance of pathology-inducing reference-based signals.

Purified OPSD: PMI-Anchored Distillation Target Construction

To eliminate reference-specific memorization and preserve general-purpose reasoning, the authors introduce a two-step corrective scheme:

  1. Reference-Only Teacher: The first step is to isolate the non-transferable, reference-induced component by constructing a reference-only teacher—i.e., the base model conditioned on the solution reference but not the question—thereby making explicit the component of the gradient that can never transfer to deployment conditions where ground-truth references are unavailable.
  2. PMI Transformation: The residual between the full privileged teacher update and the reference-only teacher update is a per-token log-probability difference, reflecting the question-conditioned correction. This is interpreted as a conditional PMI signal, which is then combined with the clean base model distribution (conditioned only on the question, never the reference) to form a purified distillation target:

PPMI(v)P0(v)exp(β  (logTT(v)logTref(v)))P_{\text{PMI}}(v) \propto P_0(v) \exp\left(\beta \; (\log T_T(v) - \log T_{\text{ref}}(v))\right)

where P0P_0 is the base model distribution, TTT_T the teacher output, TrefT_{\text{ref}} the reference-only teacher, β\beta a correction strength parameter, and vv a vocabulary token.

A numerically robust, stabilized PMI target is constructed by centering and softly clipping extreme residuals. This target is then used in place of the raw teacher in the JSD distillation objective.

Experimental Results

Extensive evaluation across four long-CoT models (Qwen3-8B, Qwen3-4B, R1-Distill-7B, OLMo-7B) and two challenging datasets (DASD-10K, Math-CoT-20K) demonstrates that:

  • Standard OPSD yields negligible or negative gains, often destabilizing reflective reasoning and degrading accuracy across multiple mathematical reasoning benchmarks.
  • Purified OPSD with the PMI target consistently improves accuracy relative both to the base model and OPSD-Standard, robustly across all model-dataset combinations.
  • Reflective behaviors, as measured by the distribution and magnitude of epistemic markers, are preserved by Purified OPSD but severely disrupted by standard OPSD.
  • The PMI-based approach is robust to reasonable choices of key hyperparameters (clipping threshold and correction strength), and its performance is not sensitive to checkpoint selection, reducing operational complexity.

Theoretical Implications

The decomposition approach establishes that naive use of privileged reference solutions for token-level alignment can be counterproductive in reflective, deliberate reasoning regimes, in contrast to success stories in shorter, less epistemically rich tasks. The PMI grounding situates the method within the literature on KL-regularized policy improvement, as the purified distillation target emerges as an information-theoretically optimal solution to the constrained reward-maximization problem where transferability, not privileged alignment, is the objective.

Practical Implications and Future Directions

Practically, Purified OPSD offers a simple drop-in replacement for OPSD that avoids the catastrophic collapse of epistemic reasoning in long-CoT distillation. The computational cost is minimal, requiring only additional frozen-model forward passes for PMI computation.

Potential avenues for further investigation include extending this decomposition/Purification approach to other domains with privileged supervision (e.g., multimodal LMs, RL-from-human-feedback with intermediate signals), exploration of more nuanced residual decomposition techniques, and understanding the impact on sample efficiency and implicit representation learning of reasoning features.

Conclusion

This study identifies and solves a core pathology of on-policy self-distillation for long-CoT models: the dominance of non-transferable, reference-induced gradients that corrupt reflective, generalizable reasoning. By leveraging a reference-only teacher and PMI-based target construction, Purified OPSD ensures that only question-conditioned, inference-transferable corrections are distilled, yielding superior reasoning accuracy and stable epistemic behavior across diverse models and benchmarks. The results highlight the necessity of carefully separating transferable and non-transferable supervision in privileged distillation for robust AI reasoning transfer.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Explain it Like I'm 14

Purified OPSD: On-Policy Self-Distillation Without Losing How to Think — Explained Simply

What is this paper about?

This paper looks at how to teach smaller AI models to “think” better without making them just copy answers. The authors study a popular training method called on‑policy self‑distillation (OPSD) and show why it often fails for models that use long, reflective chains of thought. Then they propose a fix that keeps the model’s natural thinking style while still improving accuracy.

What questions were the researchers asking?

They focused on two main questions:

  • Why does standard OPSD sometimes make “thinking” models worse, not better?
  • Can we adjust OPSD so it gives help that actually transfers to new problems, instead of pushing the model to memorize?

How did they study it? (Methods in everyday terms)

First, some quick definitions in simple language:

  • Long chain‑of‑thought (long‑CoT): When a model writes out detailed reasoning, including hesitations like “Wait” or “Maybe,” before answering.
  • OPSD (on‑policy self‑distillation): Imagine a student solves a problem their own way. Then a teacher with the answer key checks every step and nudges the student to make their steps more “like the teacher’s.”
  • Reference solution: The answer key and sample solution the teacher can see but the student won’t have during real tests.
  • Epistemic markers: Words like “Wait,” “Maybe,” “Let me think” that show the model is reflecting and checking itself.

What the researchers did:

  1. They trained several long‑CoT models with standard OPSD and watched what happened over time—both to accuracy and to the model’s “thinking behavior” (those reflection words).
  2. They invented a way to break the teacher’s advice into two parts:
    • The “reference‑induced” part: advice that comes from already knowing the answer (not helpful during real tests).
    • The “question‑conditioned” part: advice that truly helps you solve the problem from the question itself (useful during real tests). They created a “reference‑only teacher” (the same model reading only the solution, not the question) to measure the first part. Then they subtracted it to isolate the second, good part.
  3. They turned that good part into a target the student can learn from using a tool called pointwise mutual information (PMI). In plain terms, PMI helps measure how much more likely a word (like the next step in a solution) becomes because of the question, not because of the answer key. They then “anchor” this correction onto the model’s normal way of speaking, so the model keeps its natural reasoning style while learning useful improvements.

Analogy: Think of learning math. A teacher who only shows you the final solution path can make you memorize it. But if the teacher instead highlights where your own reasoning can be improved—based on the question you’re solving—you learn how to think, not just how to copy. The PMI step is like carefully adjusting your thinking in the right places without changing your overall style.

What did they find, and why is it important?

Key findings:

  • Standard OPSD hurts long‑CoT models. Across multiple models and datasets, it gave tiny, short‑lived gains—or even made performance worse.
  • It also messed up the models’ reflective behavior. The use of “thinking” words either collapsed (almost disappeared) or ballooned in a weird way (e.g., repeating “Wait” a lot). That’s a sign of unhealthy reasoning.
  • The reason: Most of the teacher’s guidance came from the answer key (the “reference‑induced” part). This pushed the student to memorize answer‑specific shortcuts instead of learning general thinking skills.
  • Their fix—Purified OPSD with PMI targets—consistently improved accuracy across four different long‑CoT models and two math datasets and kept the “thinking” behavior stable and natural. It also trained stably over time (no need for tricky early stopping) and added very little extra compute.

Why this matters:

  • Teaching models to think is different from teaching them to copy. If training accidentally rewards copying, the model won’t generalize to new problems. By filtering out “answer‑sheet hints” and keeping only the question‑driven help, the new method improves both correctness and healthy reasoning.

What does this mean going forward? (Implications)

  • For building better student models: If you want smaller or faster models that still reason well, you should avoid training signals that rely on answer keys the model won’t see at test time.
  • For research and practice: The PMI‑based “purification” can be plugged into existing OPSD pipelines with minimal overhead. It offers a safer, more reliable way to distill reasoning without breaking a model’s ability to reflect and self‑correct.
  • Bigger picture: This work shows that preserving “how to think” matters as much as getting the right answer. Methods that keep reflective behavior intact are likely to generalize better to new, hard problems.

Knowledge Gaps

Knowledge gaps, limitations, and open questions

Below is a concise list of what remains missing, uncertain, or unexplored in the paper, written to guide concrete follow-up research.

  • Generalization beyond math long-CoT: Validate OPSD-PMI on diverse reasoning domains (code generation/debugging, scientific QA, commonsense/logic, multi-step planning, multi-modal tasks) to assess whether the reference-induced failure and PMI remedy hold outside competition math.
  • Scaling behavior across model sizes: Test OPSD-PMI on much smaller (≤1B) and larger (≥30B–70B) models, and derive scaling laws for gains, stability, and epistemic preservation as parameters and context lengths grow.
  • Teacher choice and strength: The decomposition uses a frozen base model for TT and Tref; investigate whether findings persist when the privileged teacher is substantially stronger/different (e.g., larger model, different architecture, or external solver) and/or when the teacher is updated during training.
  • Reference availability and quality: Quantify sensitivity to incomplete, noisy, or incorrect reference solutions; study coping strategies (confidence-weighted PMI, filtering, robust estimation) when references are unreliable or partially missing.
  • Divergence mismatch: The PMI target is derived under KL-regularized optimization, but training uses generalized JSD; evaluate using KL vs JSD (and other f-divergences) and analyze how divergence choice affects stability, alignment, and performance.
  • Sequential dependency handling: The PMI residual is computed per-token independently; explore sequence-aware formulations (e.g., structured PMI over n-grams or latent steps, credit assignment across reasoning phases) that account for long-range dependencies in CoT.
  • Epistemic marker validity: Move beyond token counts (“Wait”, “Maybe”) to stronger measures of reflective reasoning (human evaluation, uncertainty calibration, self-correction rates, error taxonomy) and test cross-lingual markers to ensure proxy validity across languages.
  • Early-phase damage and scheduling: The paper notes harmful early reference memorization; investigate training schedules that avoid early collapse (e.g., annealing β, delayed reference exposure, curriculum that ramps PMI strength) and quantify their impact.
  • Integration with RLHF/DPO and off-policy distillation: Assess whether PMI targets complement preference-based methods (DPO, RLHF) or off-policy distillation, and whether combining them mitigates failure modes while preserving reflective behavior.
  • Calibration and safety: Measure whether OPSD-PMI improves or degrades probability calibration, uncertainty reporting, and error awareness (e.g., Brier score, selective prediction, abstention behavior), and examine risks of overconfidence or hallucinations.
  • Fine-tuning regime dependence: Results rely on LoRA (rank 64); test full-parameter fine-tuning, different adaptation ranks, optimizers, and quantization to determine robustness across training setups.
  • Long-context robustness: Training caps completions at 1024 tokens; evaluate stability and performance for longer reasoning chains (2–8k tokens), including memory/computation overhead and PMI numeric stability at scale.
  • Decoding hyperparameters and on-policy generation: Detail and test sensitivity to sampling parameters (temperature, top-p, nucleus vs greedy, beam search), trajectory length, and stochasticity in on-policy generation, as these choices can materially affect supervision signals.
  • PMI clipping and centering design: Analyze the impact of tanh soft clipping and centering on learning dynamics; compare alternative normalization/clipping strategies (e.g., percentile clipping, adaptive bounds) and study their theoretical and empirical trade-offs.
  • Anchor distribution selection: PMI is anchored on the base question-only distribution P0; investigate alternative anchors (current student, teacher-student mixtures, trust-region baselines) and their effects on stability vs plasticity.
  • Per-problem error analysis: Provide qualitative and quantitative analyses of how PMI changes reasoning trajectories (e.g., fewer spurious shortcuts, more effective self-correction) and which error types are most improved or remain stubborn.
  • Cross-dataset generalization: Test transfer from training datasets (DASD-10K, Math-CoT-20K) to diverse unseen benchmarks, controlling for potential overlap and distribution shift, to substantiate claims about inference-transferability.
  • Multilingual applicability: Verify PMI efficacy and epistemic preservation in non-English settings, including the behavior of language-specific epistemic markers and references with different script/tokenization properties.
  • Prompt and reference formatting sensitivity: Study how variations in how references are inserted (format, position, granularity of steps) affect the decomposition (TT vs Tref) and downstream PMI targets.
  • Measurement of computational overhead: Provide detailed wall-clock, memory, and throughput measurements across hardware/software stacks; explore batching/caching strategies to reduce the added forward-pass cost and quantify real-world efficiency.
  • β scheduling and autotuning: Beyond fixed β and limited ablations, develop principled schedules or adaptive controllers (e.g., reward shaping, uncertainty-aware scaling) to optimize the trade-off between correction strength and stability without manual tuning.
  • Metric-level linkage: Establish a tighter causal link between decomposition metrics (cosine similarity, norm fractions) and downstream accuracy/robustness, possibly via controlled experiments or theoretical bounds connecting update alignment to generalization.
  • Numerical properties of the decomposition: Investigate cases where |Aref|/|Atotal| > 1 and anti-alignment occurs, assess whether this reflects systematic properties (e.g., teacher peaky distributions) or artifacts, and propose more robust estimators of transferable supervision.
  • PMI on structured references: Extend PMI beyond per-token residuals to handle step-level or graph-structured references (intermediate solutions, proofs, programs), potentially improving transfer for hierarchical reasoning.
  • Reproducibility and variance: Report seed-wise variability, confidence intervals across more runs/checkpoints, and sensitivity to dataset subsampling to ensure conclusions are statistically robust and replicable.

Practical Applications

Below is an analysis of the paper’s practical implications. The items are grouped into Immediate Applications (deployable with today’s tooling) and Long-Term Applications (requiring further research, scaling, or validation). Each bullet names concrete use cases, sectors, potential tools/workflows, and key assumptions or dependencies.

Immediate Applications

  • Stabilize existing OPSD pipelines for reasoning LLMs
    • Sector: AI/ML platforms, model providers (software)
    • Use case: Replace standard OPSD with the paper’s PMI-target (OPSD-PMI) to prevent rote memorization and preserve reflective reasoning in long-CoT training.
    • Tools/workflows: Add “reference-only teacher” forward pass and PMI target construction (three frozen forward passes + student pass; <10% overhead); drop-in for JSD-based OPSD loops; LoRA-compatible.
    • Assumptions/dependencies: Availability of reference solutions during training; teacher/student share base weights; long-CoT data; adequate context window.
  • Train compact math/science/coding reasoners that retain “how to think”
    • Sectors: Education (EdTech), software engineering (code assistants), scientific software
    • Use case: Distill larger “thinking” models into smaller ones for math problem solving, code reasoning, or scientific Q&A while preserving uncertainty expressions and deliberate chains.
    • Tools/workflows: PMI-target fine-tuning with LoRA; checkpoint monitoring; per-token PMI correction strength and soft-clipping as in the paper.
    • Assumptions/dependencies: Chain-of-thought (CoT) solutions with references; careful hyperparameter selection (but shown robust to c, β).
  • MLOps: Epistemic marker monitoring to prevent degenerate reasoning
    • Sectors: AI operations across domains (healthcare, finance, enterprise)
    • Use case: Add dashboards that track epistemic tokens (“wait”, “maybe”, “let me think”) and their distribution during training/QA to catch collapse or repetition.
    • Tools/workflows: Logging hooks for epistemic tokens; alerting when marker counts diverge; per-checkpoint reports.
    • Assumptions/dependencies: Marker lists calibrated for domain and language; avoid “gaming” the metric by models.
  • Auditing privileged-information overfitting in distillation
    • Sectors: Regulated industries (healthcare, finance, legal), AI safety and compliance
    • Use case: Use the “reference-only teacher” probe to decompose updates into reference-induced vs inference-transferable components, flagging when training relies on privileged shortcuts.
    • Tools/workflows: Training-time or post-hoc decomposition (A_ref vs A_it), cosine similarity and norm fraction tracking; audit reports.
    • Assumptions/dependencies: Ability to run teacher with and without the question; access to training prompts and references; reproducible seeds.
  • Improve RAG-/retrieval-augmented training by quantifying shortcutting
    • Sectors: Enterprise search, customer support, knowledge management
    • Use case: Treat retrieved passages as “references”; use the probe to measure when models memorize retrieval cues instead of problem reasoning; adjust policies accordingly.
    • Tools/workflows: Retrieval-aware decomposition; PMI-target fine-tuning to strip retrieval-induced bias; RAG evaluation with A_it metrics.
    • Assumptions/dependencies: Clear separation of question vs retrieved context; stable retrieval pipeline.
  • Safer RLHF/policy optimization via PMI-style KL anchoring
    • Sectors: AI labs, model training platforms
    • Use case: Use the PMI residual as a token-level reward signal with KL anchoring to the base policy to mitigate mode collapse and preserve reasoning behaviors in RLHF/DPO-style training.
    • Tools/workflows: Integrate PMI-derived P_target into RLHF epochs; adjustable β for stability/performance trade-offs.
    • Assumptions/dependencies: Access to a teacher with and without privileged context; compatibility with existing RLHF pipelines.
  • Data curation guided by inference-transferable signal
    • Sectors: Dataset providers, LLM training teams
    • Use case: Prioritize examples with higher A_it magnitude (more transfer) for training sets; downweight items dominated by A_ref to boost generalization.
    • Tools/workflows: Batch scoring of training items by A_it norms; selection and reweighting; curriculum schedules.
    • Assumptions/dependencies: Teacher computations at scale; selection bias mitigation.
  • On-device assistants that keep reflective reasoning
    • Sectors: Mobile OEMs, consumer apps
    • Use case: Distill cloud “thinking” models to smaller on-device models (e.g., 3–8B) for step-by-step reasoning without losing epistemic behavior.
    • Tools/workflows: PMI-based distillation with LoRA or QLoRA; mixed-precision; latency-aware batching of frozen passes.
    • Assumptions/dependencies: Availability of long-CoT traces for target tasks; device memory/compute constraints.
  • Uncertainty-aware assistants for safety-critical domains
    • Sectors: Healthcare (triage/pre-diagnosis), legal research, finance (risk analysis)
    • Use case: Preserve uncertainty externalization in assistant outputs via PMI-target distillation to maintain deliberation and avoid premature certainty.
    • Tools/workflows: Marker-preserving objectives; QA verifying marker stability; domain-specific lexicon of epistemic cues.
    • Assumptions/dependencies: Regulatory guidance on uncertainty communication; domain calibration and human-in-the-loop review.

Long-Term Applications

  • Standards and policy for “thinking-preserving” distillation
    • Sectors: Standards bodies, regulators, enterprise governance
    • Use case: Define guidelines requiring update decomposition (A_ref vs A_it) and epistemic-marker stability checks for deployed reasoning systems in high-stakes settings.
    • Tools/workflows: Compliance test suites, reporting formats for cosine similarity/norm fractions, red-team protocols.
    • Assumptions/dependencies: Community consensus on markers and thresholds; reproducibility across vendors.
  • Reflective long-horizon planners in robotics and autonomy
    • Sectors: Robotics, autonomous vehicles, industrial automation
    • Use case: Distill long-horizon planning policies from privileged simulators while stripping simulation-specific shortcuts; retain reflective planning behaviors.
    • Tools/workflows: Multimodal PMI-target variants; trajectory-level extensions; safety envelopes.
    • Assumptions/dependencies: Long-CoT-like traces for planning; alignment with control safety requirements; validation in sim-to-real transfer.
  • Modality-general “reference-only” probing beyond text
    • Sectors: Multimodal AI (medical imaging, geospatial, speech)
    • Use case: Extend decomposition to images/audio/sensors (e.g., probe supervision that is reference- or hint-induced vs problem-induced) to combat shortcut learning across modalities.
    • Tools/workflows: Logit-space residuals for multimodal encoders; PMI-style targets anchored to clean base distributions.
    • Assumptions/dependencies: Clear operational definition of “reference” per modality; calibrated token/logit spaces.
  • Pedagogically aligned tutoring systems that teach reasoning
    • Sectors: Education, workforce upskilling
    • Use case: Tutors that resist solution-path memorization and focus on question-conditioned feedback; individualized reasoning curricula.
    • Tools/workflows: PMI-distilled tutors; curricula prioritizing high-A_it items; formative assessment tied to epistemic behavior.
    • Assumptions/dependencies: Rich CoT datasets aligned with pedagogy; longitudinal efficacy studies.
  • Certified decision-support LLMs with epistemic-behavior guarantees
    • Sectors: Healthcare, finance, legal, public sector
    • Use case: Auditable models that demonstrate stable epistemic markers and low A_ref dominance across updates; pathway to certification.
    • Tools/workflows: Continuous auditing with decomposition metrics; drift detection; human oversight loops.
    • Assumptions/dependencies: Regulatory acceptance of these metrics; evidence that marker stability correlates with safety and generalization beyond math.
  • Tooling products: “Thinking-preserving” distillation plugins and dashboards
    • Sectors: MLOps vendors, cloud AI platforms
    • Use case: Commercial plugins that wrap OPSD-PMI, provide decomposition analytics, and offer marker dashboards as a managed service.
    • Tools/workflows: SDKs for PyTorch/JAX; vLLM integration; batched frozen forward passes; auto-hyperparameter tuning for c and β.
    • Assumptions/dependencies: Market demand; integration with heterogeneous training stacks.
  • Benchmarking and KPIs for reflective reasoning stability
    • Sectors: Academia, industry consortia
    • Use case: New benchmarks and leaderboards that include epistemic-marker stability and A_it dominance as KPIs, discouraging shortcut-driven gains.
    • Tools/workflows: Standardized marker lexicons per language/domain; robustness tests against metric gaming (e.g., semantic measures of deliberation).
    • Assumptions/dependencies: Agreement on reliable, game-resistant measures of reflection.
  • Self-improving agents with anti-shortcut safeguards
    • Sectors: Agentic systems, automation
    • Use case: Use PMI-target in self-improvement loops so agents learn from their own trajectories without overfitting to internal “references” (memories, tools).
    • Tools/workflows: Agent frameworks that label tool outputs/retrievals as “references” and apply decomposition and PMI anchoring.
    • Assumptions/dependencies: Clear separation of internal context types; compute budget for extra passes.
  • Privacy and leakage detection in training data
    • Sectors: Compliance, privacy engineering
    • Use case: Detect when training benefits primarily from leaked or proprietary “reference-like” content by monitoring A_ref dominance; trigger mitigation.
    • Tools/workflows: Decomposition-based forensics; data pipeline interventions (masking, weighting).
    • Assumptions/dependencies: Legal and technical ability to isolate suspect references; correlation between A_ref patterns and leakage must be validated.
  • Cross-domain generalization of PMI-target distillation
    • Sectors: Legal tech, biomedical research, chemistry, policy analysis
    • Use case: Apply and validate PMI-target in domains with complex reasoning beyond math to enhance small specialist models’ generalization.
    • Tools/workflows: Domain-specific long-CoT datasets with references; adapted epistemic markers; human evaluation of reasoning quality.
    • Assumptions/dependencies: Availability of high-quality, domain-appropriate references; expert annotation capacity.

Notes on feasibility across applications:

  • The method assumes access to reference solutions (or structured “privileged” context) during training to construct T_ref; deployments without such data need analogous signals (e.g., retrieved passages, simulator hints).
  • Gains are demonstrated on math long-CoT; while the mechanism is general, cross-domain validation is needed.
  • Epistemic marker metrics are proxy signals; they should be complemented with task-specific quality and safety evaluations to avoid gaming or misinterpretation.
  • Compute overhead is modest but nonzero; batched frozen passes and efficient serving (e.g., vLLM) mitigate costs.

Glossary

  • Base distribution: The model’s probability distribution over tokens conditioned only on the question, used as a clean anchor for target construction. Example: "denote the clean base distribution conditioned on the question but not on the reference solution."
  • Centering: Subtracting the mean from a vector so its average is zero, improving numerical stability. Example: "Centering. We subtract the vocabulary-level mean to ensure that the correction is zero- centered:"
  • Chain-of-thought (CoT): A paradigm where models generate explicit intermediate reasoning steps to improve problem solving. Example: "Chain-of-thought (CoT) prompting [Wei et al., 2022] demon- strated that eliciting intermediate reasoning steps substantially improves LLM performance on complex tasks."
  • Conditional PMI-style quantity: A per-token log-likelihood ratio capturing how predictions change when conditioning on the question given the reference. Example: "We interpret this residual as a conditional PMI-style quantity:"
  • Cosine similarity: A measure of directional alignment between vectors, used to compare update components. Example: "we measure two complementary metrics: (1) cosine similarity cos(Atotal, Aref ) and cos(Atotal, Ait), capturing the directional alignment;"
  • DPO-style derivations: Analyses derived from Direct Preference Optimization, a preference-based training framework for LMs. Example: "This objective is the token-level analogue of KL-regularized policy improvement used in RLHF and DPO-style derivations [Rafailov et al., 2024], with Po serving as the reference policy and Ait serving as the implicit reward."
  • Distribution mismatch (train-test): A discrepancy between training and inference distributions that can harm generalization. Example: "However, these off-policy approaches suffer from train-test distribution mismatch, as the student trains on teacher-generated trajectories rather than its own."
  • Epistemic behavior: The model’s outward signals of uncertainty and reflection during reasoning. Example: "while preserving the models' natural epistemic behavior throughout training."
  • Epistemic markers: Tokens that explicitly express uncertainty or deliberation (e.g., “Wait”, “Maybe”). Example: "we track epistemic markers (tokens such as "Wait", "Let me think", "Perhaps", and "Maybe") that indicate uncertainty externalization and reflective reasoning"
  • Generalized Jensen-Shannon divergence (DJSD): A divergence measure generalizing JSD, used as the training loss. Example: "where DJSD denotes the generalized Jensen-Shannon divergence."
  • Gradient checkpointing: A memory-saving training technique that recomputes activations during backpropagation. Example: "Training uses a learning rate of 5e-6, a batch size of 32, and gradient checkpointing."
  • Inference-transferable signal: The supervision component that improves reasoning without relying on reference-only information. Example: "capturing the question-conditioned, inference-transferable correction."
  • Jensen-Shannon divergence (JSD): A symmetric divergence between probability distributions, often used as a loss. Example: "OPSD-Standard: standard on-policy self-distillation [Zhao et al., 2026] with JSD loss"
  • KL-regularized distillation objective: An objective that maximizes a reward while penalizing deviation from a reference distribution via KL divergence. Example: "The PMI target in Eq. 5 can be derived as the closed-form optimal distribution under a KL-regularized distillation objective."
  • KL-regularized policy improvement: Policy optimization constrained to stay close (in KL) to a reference policy. Example: "This objective is the token-level analogue of KL-regularized policy improvement used in RLHF and DPO-style derivations"
  • Knowledge distillation: Training a student model to match a teacher’s soft outputs. Example: "Knowledge distillation [Hinton et al., 2015] transfers knowledge from a teacher to a student via soft label matching."
  • Lagrange multiplier: A variable that enforces constraints in optimization problems. Example: "Introducing a Lagrange multiplier ) for the constraint __ P(v) = 1, the Lagrangian is"
  • Lagrangian: The function combining objective and constraints (via multipliers) in constrained optimization. Example: "the Lagrangian is"
  • LoRA (Low-Rank Adaptation): A parameter-efficient fine-tuning method using low-rank updates. Example: "All methods use LoRA [Hu et al., 2022] adaptation with rank 64."
  • Logits: Unnormalized scores over the vocabulary before applying softmax. Example: "We then obtain three sets of logits over the full vocabulary V at each position t:"
  • Long chain-of-thought (long-CoT): Extended, reflective reasoning sequences used by “thinking” models. Example: "long chain-of-thought (long-CoT) reasoning models"
  • Norm fraction: The ratio of a component’s vector norm to the total update’s norm, indicating magnitude dominance. Example: "Right columns: magnitude dominance (norm fraction)."
  • On-policy self-distillation (OPSD): Distillation where the student learns from its own generated trajectories with guidance from a privileged teacher. Example: "On-Policy Self-Distillation (OPSD) [Agarwal et al., 2024, He et al., 2026, Zhao et al., 2026, Cui et al., 2026] has shown promise for improving reasoning capabilities through privileged teacher guidance."
  • On-policy trajectories: Sequences generated by the current model policy during training. Example: "On-policy trajectories are generated using vLLM [Kwon et al., 2023]."
  • Pointwise Mutual Information (PMI): An information-theoretic measure of association between events beyond chance. Example: "Pointwise mutual information (PMI) is a classical measure from information theory that quantifies the association between two events beyond what would be expected under independence"
  • Privileged supervision: Guidance using information available only to the teacher (e.g., reference solutions), not at inference. Example: "the intended purpose of privileged supervision"
  • Privileged teacher: A teacher model with access to reference solutions during training. Example: "a privileged teacher that has access to reference solutions"
  • Reference contamination: Undesired influence of reference information in targets intended for reference-free inference. Example: "which is free of reference contamination"
  • Reference-induced component: The part of the supervision signal driven solely by the reference, not the question. Example: "the teacher's supervision is dominated by a reference-induced component"
  • Reference-only teacher: The same model conditioned on the reference solution but not the question, used to isolate non-transferable signal. Example: "we construct a reference-only teacher (the same model conditioned on the reference solution without the question)"
  • Reference policy: A baseline distribution used to regularize updates via KL penalties. Example: "with Po serving as the reference policy"
  • Reinforcement Learning from Human Feedback (RLHF): Training that uses human preference signals to shape model behavior via RL. Example: "RLHF and DPO-style derivations"
  • Soft clipping: Smoothly bounding values to limit extremes (e.g., using tanh) while preserving order. Example: "We apply tanh-based soft clipping to bound extreme PMI values while preserving the direction and relative ordering of moderate values:"
  • Softmax: A normalization function that converts logits to probabilities. Example: "TT = softmax(lT), Tref = softmax(lref)."
  • Token-level supervision: Training signals provided for each token rather than only at sequence level. Example: "providing token-level supervision through divergence minimization."
  • vLLM: A high-throughput system for efficient LLM inference/serving. Example: "On-policy trajectories are generated using vLLM [Kwon et al., 2023]."

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 4 tweets with 31 likes about this paper.