Contents
  1. Teacher supervision and the behavior to preserve
  2. Supervision interfaces and compatibility
  3. Soft targets, temperature, and student updates
  4. Selected responses and rationale targets
  5. Teacher feedback on student-generated prefixes
  6. Transfer-data coverage and selection
  7. Target validity, privileged information, and lineage
  8. Student capacity and task specialization
  9. Controlled transfer experiments and failure diagnosis
  10. Fidelity and independent task correctness
  11. Deployment constraints and reassessment
  12. Check understanding
  13. Open questions
  14. Selected talks
  15. References
  16. Talk library
← All topics

Distillation

Distillation trains one model using information supplied by another. It can produce a smaller model or specialize an existing one, but neither size reduction nor useful transfer is automatic. The central decisions concern what behavior to preserve, which teacher signals to expose, where to provide supervision, and how to separate successful imitation from correct, economical operation.

Teacher supervision and the behavior to preserve

A teacher supplies supervision; a student learns from it. Distillation transfers behavior through training rather than copying parameters. The teacher can also be an ensemble that combines several models.

Training changes learned parameters; inference applies the resulting model to inputs. A student can therefore use teacher-produced examples during training without calling the teacher during deployment. The broader distinction belongs to training, fitted state, and inference.

Teacher information ends at training

The student persists across stages; deployment uses its learned checkpoint.

1 / 3 · Initialization

The student starts from an identified parameter state.

Supervised transfer updates the student from curated teacher outputs. Deployment retains the checkpoint and adds requests and predictions; the teacher is absent.
Read the diagram as text
  • Student.
  • Initial learned state.
  • Teacher.
  • Curated teacher outputs.
  • Trained checkpoint available. Saved student parameters after transfer.
  • Deployment request.
  • Student prediction.
  • Initial learned stateStudent: initializes parameters.
  • TeacherCurated teacher outputs: supplies candidate outputs.
  • Curated teacher outputsStudent: supervises training.
  • StudentTrained checkpoint available: has saved learned state.
  • Deployment requestStudent: inference input.
  • StudentStudent prediction: inference output.
  1. Initialization. The student starts from an identified parameter state. Active: Student, Initial learned state. New: Student, Initial learned state.
  2. Transfer completed. Teacher supervision produces a trained checkpoint; the initial-state node is hidden. Active: Student, Teacher, Curated teacher outputs, Trained checkpoint available. New: Teacher, Curated teacher outputs, Trained checkpoint available.
  3. Inference. The student and checkpoint remain. Requests and predictions replace the training-only entities. Active: Student, Trained checkpoint available, Deployment request, Student prediction. New: Deployment request, Student prediction.

Smaller size is optional. Born-Again Networks trained students with the teacher's architecture, demonstrating useful transfer without reducing architecture size. Reusing an architecture does not mean copying its learned weights.

Behavioral fidelity means agreement with specified teacher behavior under stated conditions. Exact text, selected categories, probability distributions, and meaning are different comparison targets. Correctness requires a separate standard: faithfully repeating a teacher's error remains an error.

A ticket-triage assistant assigns a category and a short justification. Its transfer contract can distinguish preservation from permitted change.
RequirementPreservePermit or check independently
InputsTicket text and permitted metadataNo dependence on unavailable case resolutions
CategoryDeclared category vocabularyCorrect a teacher label when independent review contradicts it
JustificationSupport from available evidenceParaphrases that preserve meaning
ExceptionsEscalate cases requiring reviewTest exceptions separately from routine accuracy

An acceptance criterion makes a requirement observable. Numerical compression is a separate choice: quantization changes numerical representation, while distillation changes learned behavior through teacher supervision. They can be combined, but neither guarantees the other's benefits.

Supervision interfaces and compatibility

A hard target selects a label or response. A soft target supplies probabilities over alternatives. Logits are scores before probability normalization; a language model produces one per vocabulary entry. Vocabulary readout explains how these scores become next-token probabilities.

Teacher exposesAvailable supervisionBoundary
Selected text or labelA demonstrated outputUnselected alternatives are absent
Full output distributionProbabilities for every outcomeOutcomes and prediction positions must correspond
Top-k probabilitiesSelected alternatives and their reported probabilitiesOmitted mass requires an explicit approximation
Internal activationsIntermediate feature targetsRequires internal access and feature correspondence

Feature targets require correspondence

A projected student feature is compared with the teacher activation.

Squared feature error trains the regressor and guided student portion. Matching this projection does not establish identical representations or behavior. Output distillation is separate.
Read the diagram as text
  • Input.
  • Selected teacher activation.
  • Selected student activation.
  • Regressor output. Teacher-sized prediction.
  • Squared feature error.
  • Student and regressor update.
  • InputSelected teacher activation: data: teacher computation.
  • InputSelected student activation: data: student computation.
  • Selected student activationRegressor output: data: learned regressor.
  • Selected teacher activationSquared feature error: data: target.
  • Regressor outputSquared feature error: data: prediction.
  • Squared feature errorStudent and regressor update: training control: minimize.

Token IDs obtain meaning from a vocabulary mapping. Equal IDs or vocabulary sizes do not establish compatibility. Different tokenizers also divide text differently, so prediction positions can diverge. Direct coordinatewise probability matching needs aligned outcomes and positions; generated text can instead be encoded with the student's tokenizer.

Suppose a teacher reports probabilities 0.60 and 0.25 for two alternatives. Their sum is 0.85: 0.15 remains elsewhere. Renormalizing gives approximately 0.706 and 0.294, a distribution conditional on the retained alternatives. That changes the target. A service interface must specify which information and approximation it provides.

An intermediate representation is a vector computed inside a model. FitNets trains a regressor from selected student features to a teacher layer's dimensions using squared error, followed by separate output distillation. This supports thinner, deeper students, but overly deep guided layers can overconstrain learning.

Soft targets, temperature, and student updates

Alternative probabilities reveal distinctions discarded by selecting a winner. Temperature reshapes those probabilities: larger values soften the distribution. These example teachers both select Billing but disagree about the closest alternative.

Category order: Billing, Access, Other. Probabilities are rounded.
Teacher logitsTemperatureCategory probabilities
[2, 1, 0]1[0.665, 0.245, 0.090]
[2, 0, 1]1[0.665, 0.090, 0.245]
[2, 1, 0]2[0.506, 0.307, 0.186]
[2, 0, 1]2[0.506, 0.186, 0.307]
qT(i)=exp(zi/T)jexp(zj/T),H(a,b)=iailogbiq_T(i)=\frac{\exp(z_i/T)}{\sum_j\exp(z_j/T)},\qquad H(a,b)=-\sum_i a_i\log b_i L=αT2H(qT,pT)+(1α)H(y,p1)L=\alpha T^2H(q_T,p_T)+(1-\alpha)H(y,p_1) Here ziz_i is a teacher logit; qTq_T and pTp_T are teacher and student distributions over classes ii. Temperature T>0T>0; weight 0α10\leq\alpha\leq1. The independent label yy assigns probability one to its class. Cross-entropy HH penalizes insufficient target probability.

The T2T^2 factor approximately compensates temperature-dependent gradient scaling. Without independent labels, omit their term. Temperature and weighting remain empirical choices.

In a fixed-teacher experiment, teacher targets remain constant while the optimizer updates student parameters. The label and teacher terms can disagree, so lowering their weighted sum need not improve either term separately. Losses specify the training pressure; gradients determine parameter updates.

Softening does not establish calibration: whether predictions assigned a given confidence are correct at that frequency. Calibration and accuracy are different properties. A distribution can become less concentrated without becoming a better account of correctness.

Selected responses and rationale targets

Sequence-level distillation trains on selected teacher responses. Selection matters: Kim and Rush used beam search, which keeps several candidate continuations, to produce translation targets. Their reference-based variant selected the candidate most similar to an existing translation. The same teacher can therefore supply different supervision under different selection rules.

A prefix is the text available before a prediction. Teacher forcing conditions predictions on recorded predecessors instead of the model's generated choices. Shifted-target training uses each position to predict the following token. Here, each displayed symbol is one token in a deliberately small vocabulary.

Recorded sequence: Ticket: → locked → Reply: → Access → locked-out → END. Response-only supervision includes the response-ending marker.
Input positionNext-token targetLoss mask
Ticket:locked0
lockedReply:0
Reply:Access1
Accesslocked-out1
locked-outEND1

A loss mask selects prediction targets that contribute directly to training. Excluding prompt targets does not remove the prompt's conditioning role. Supervised fine-tuning, covered in Post-training and Alignment, increases the probability of demonstrated next tokens. It rewards the recorded response, not truth or execution success directly.

A rationale is a written explanation supplied as another target. Distilling Step-by-Step trained pretrained T5 students on separate label-prediction and rationale-generation tasks, selected by task prefixes. Label inference did not require a teacher rationale. Some settings combined human labels with teacher rationales; the improvements were task-specific.

Rationale usefulness and faithfulness require different evidence. An explanation may help a student without accurately describing how the teacher reached its answer. Hint-intervention experiments found that reasoning models sometimes omitted answer influences from their explanations. Generated reasoning is observable supervision, not direct access to hidden computation.

The teacher's training method also need not become the student's method. DeepSeek-R1's smaller distills received supervised training on curated outputs. Using outputs from a reinforcement-learned teacher did not mean those students repeated its reward-based training procedure.

Teacher feedback on student-generated prefixes

Token-distribution distillation matches next-token distributions at a prefix. Recorded prefixes can differ from those reached during student generation. On-policy distillation obtains teacher feedback at student-visited prefixes, including mistaken continuations. The student's sampled token determines visited context; it does not become ground truth.

A rollout is a generated sequence of choices and resulting context. Generalized Knowledge Distillation mixes recorded examples with student rollouts. Its implementation differentiates the distribution-matching loss, without backpropagating through discrete sampling. This changes where supervision is supplied, not whether the teacher is correct.

Different prefixes need different feedback

Example

A changed category changes the context for the justification.

The shared ticket prompt branches by continuation source. Teacher feedback is conditioned separately on each resulting prefix; both losses compare distributions at their own prefix.
Read the diagram as text
  • Ticket: cannot sign in.
  • Recorded prefix: Access.
  • Student prefix: Billing.
  • Teacher distribution after Access.
  • Teacher distribution after Billing.
  • Recorded-prefix matching.
  • Student-prefix matching.
  • Ticket: cannot sign inRecorded prefix: Access: source: recorded continuation.
  • Ticket: cannot sign inStudent prefix: Billing: source: student sampling.
  • Recorded prefix: AccessTeacher distribution after Access: conditions teacher.
  • Student prefix: BillingTeacher distribution after Billing: conditions teacher.
  • Teacher distribution after AccessRecorded-prefix matching: target distribution.
  • Teacher distribution after BillingStudent-prefix matching: target distribution.
  • Recorded prefix: AccessRecorded-prefix matching: conditions student prediction.
  • Student prefix: BillingStudent-prefix matching: conditions student prediction.
Target timingBenefitCost or constraint
Precompute selected responsesReuse a fixed target datasetStore targets; their prefixes remain fixed
Query during trainingScore newly generated student sequencesTeacher computation and a suitable scoring interface remain necessary

Scoring an existing sequence requires access to probabilities for its supplied positions. An API that generates a one-token response does not necessarily return those scores. Rollout collection can resemble reinforcement learning while supervision comes from teacher likelihoods rather than an environment reward.

Transfer-data coverage and selection

The transfer dataset contains situations in which the student receives teacher supervision. Its inputs need not already have human labels: a teacher can generate targets for collected inputs. Input fitness and target correctness remain separate decisions.

Coverage concerns which intended cases are accessible and represented. Selection bias arises when choosing records systematically changes that representation. More examples from a narrow source do not recover excluded conditions. Coverage and sampling provide the general framework.

Suppose the initial ticket collection contains routine English requests. The coverage record distinguishes existing examples from proposed additions.
ConditionInitial coverageSelection decision
Routine categoriesRepresentedRetain workload examples
Ambiguous categoriesUnavailableTarget boundary cases
Other languages and formatsUnavailableCollect intended variations
Rare required escalationsUnavailableObtain independently reviewed cases

Easy-only selection can omit boundaries; disagreement-only selection can omit routine behavior and shared mistakes. Confidence filtering can exclude difficult conditions. Inspect rejected records as well as retained ones: C4's filtering analysis found benign material removed disproportionately. That demonstrates a selection hazard, not an optimal distillation sampling recipe.

Generated scenarios can fill an initial collection gap. Rechat used an LLM to simulate user requests across supported workflows before substantial usage existed. Such synthetic data supplies possible inputs, not independent correctness labels or proof of deployment coverage.

Keep transfer construction, development selection, and protected assessment separate. A random split within a restricted collection does not make it representative; repeatedly consulting final results converts assessment into development. Independent data boundaries apply equally to teacher-generated records.

Target validity, privileged information, and lineage

Privileged information is available to the teacher during transfer but absent from ordinary student inputs. Richer teacher context can support useful learning: generalized distillation explicitly permits different teacher and student representations. However, a case-specific conclusion may be impossible to recover from what the student receives.

Hinted self-distillation uses the same model as a better-informed teacher. A hint-enriched prompt supplies teacher probabilities while the student receives the ordinary prompt. Teacher scores must correspond to the original student prediction positions; adding context does not remove the alignment requirement.

For a login ticket, a teacher might know that a single-sign-on token expired. If the deployed student can inspect logs, guidance to inspect them teaches an available procedure. Revealing the hidden diagnosis can instead teach an answer-first shortcut. Removing the hint from the student's prompt does not undo that target dependence.

Target checks should follow the contract: parse the output, check categories against independent labels, and review whether justifications follow from permitted evidence. Evaluation workflows can route promising examples and failures through human review before updating training data. Label validity remains distinct from passing a format check.

Teacher confidence cannot replace those checks. Token likelihood concerns a continuation; answer correctness is a different event. Even a generated confidence statement needs validation against observed outcomes before it can be treated as a probability.

A supervision record can apply provenance principles without requiring a universal distillation schema.
Record groupPreserve
ProductionTeacher version, instructions, input, teacher-only context, generation settings
SelectionCandidate output, checks, selection rule, inclusion or review decision
DerivationTarget transformations, source-record identity, dataset version

Record derivations across dataset releases, including excluded candidates needed to inspect selection. Provenance describes how a target arose; it does not certify its truth or authorize its use. Vendor and model-processing obligations govern the separate permitted-use boundary.

Student capacity and task specialization

Representational capacity concerns distinctions a model can express. Architecture constrains that space; initialization and optimization affect the solution training reaches. Poor agreement alone does not identify insufficient capacity: students have failed to match teachers even with identical architectures capable of representing the teacher solution.

A more accurate teacher need not produce a better student. Cho and colleagues observed deteriorating student accuracy with some larger teachers in their classification experiments. Transfer-fit diagnostics supported a capacity-mismatch interpretation there; increasing temperature did not resolve it. That finding does not exclude optimization or data limitations elsewhere.

Task specialization changes what must fit. Predicting a bounded category set and justification is a narrower target than preserving every teacher capability. Distilling Step-by-Step compared student sizes, data quantities, and label-only versus rationale supervision. Such controls reveal task-specific gains without establishing general teacher equivalence.

A student may also outperform its teacher on a bounded evaluation. Born-Again Networks demonstrated improvements with individual students; ensembles of successive generations were a separate configuration. Neither result implies universal superiority or that architecture reuse alone causes improvement.

Available inputs impose another limit. If two cases look identical to the student but require different outputs because of hidden teacher information, increasing parameter count cannot reveal that missing case-specific fact. Change the available evidence or the task requirement before treating every failure as a size problem.

Controlled transfer experiments and failure diagnosis

A checkpoint saves learned model state. Bind each candidate checkpoint to its initial student, target-dataset version, teacher configuration, loss weights, and training conditions. An ablation changes or removes a component to test its contribution. Controlled comparisons require identifiable alternatives, not merely two differently named models.

Compare the initial student, teacher-supervised training, and independent-label training when those labels exist. Keep the student starting point and relevant data and training conditions explicit. Label-only and rationale-supervised baselines help distinguish improvement from additional supervision versus improvement already available through ordinary task training.

Symptoms guide investigation; they do not uniquely identify causes.
ObservationCompeting explanationsBounded probe
Poor training agreementAlignment, optimization, or capacity limitsVerify alignment; vary teacher difficulty or student capacity separately
Good training agreement; poor unseen agreementInsufficient transfer coverage or generalizationAdd missing conditions while holding supervision fixed
High agreement; low correctnessTeacher errors or unsuitable objectiveAudit independently labeled teacher-wrong cases

Target defects and prefix mismatch can coexist. If repairs and student-prefix supervision are introduced together, an improvement cannot identify their separate contributions. With compatible teacher scoring available, cross original versus repaired supervision with recorded versus student-generated prefixes. Keep initialization and workload coverage fixed across the four arms.

SupervisionRecorded prefixesStudent-generated prefixes
OriginalBaseline transferPrefix change alone
RepairedTarget repair aloneCombined intervention

Use development evidence for repairs and selection. Freeze the selected configuration before protected assessment. Further changes after inspecting final results require a new assessment boundary. Failure analysis preserves competing explanations instead of treating every lower loss as a solved cause.

Fidelity and independent task correctness

Top-label agreement measures shared selections; predictive-distribution comparison measures probability differences. Neither establishes correctness. In self-distillation experiments, greater agreement sometimes accompanied lower accuracy. Report the fidelity dimension promised by the contract alongside an independent task score.

Classify matched cases using independent correctness labels, then record output agreement separately.
Teacher outcomeStudent correctStudent wrong
CorrectBoth succeed; wording may differA student regression
WrongBeneficial disagreementBoth fail; they may make different errors

For ticket responses, score category correctness, supported justification, required format, and escalation behavior separately. Escalation recall is correctly escalated tickets divided by all independently labeled escalation-required tickets. Omitting difficult tickets from evaluation hides missed escalations; abstaining does not remove their reference requirements.

A slice is a meaningful subgroup, such as language, format, or escalation type. Compare teacher, student, and baselines on matched cases in important slices. Whole responses must satisfy the task contract: favorable recorded-prefix loss can coexist with free-running failures. Uncertainty in differences matters especially when rare-case samples are small.

The teacher should not be the sole judge of its transfer. Model judges can exhibit position, verbosity, and self-favoring biases. Validate judgments against independent human labels, inspect disagreements, and check these biases before using scores for selection. Automated judge reliability covers the broader procedure.

When confidence controls automatic routing, evaluate whether stated probabilities match observed correctness frequencies. Distribution shift means the evaluated input distribution changes. Calibration established on familiar data can deteriorate under shift, so thresholds need deployment-relevant checks. Calibration and selective automation separates this requirement from accuracy and agreement.

Deployment constraints and reassessment

Choose an operating point by declaring required quality and latency, then minimizing cost among configurations that satisfy them. Interactive completion and asynchronous work impose different requirements. Parameter count alone does not identify the best complete system; LLM Inference covers the serving mechanisms.

Compare complete configurations under the same intended workload.
DimensionRecord
WorkloadRequest types, input and output lengths, concurrent requests
QualityRequired outcomes and consequential slice limits
ResponsivenessFirst useful output and completed-request latency
ResourcesCompleted tasks per second, memory, and operating cost

A 95th-percentile latency is a duration at or below which approximately 95% of measured requests finish. Completed tasks per second differs from tokens per second: longer answers can increase token work without completing more tasks. Define measurement boundaries through task metrics and usage accounting, including retries and unresolved outcomes.

Amortization spreads an initial investment over subsequent use. The cost ledger must include teacher-data generation, curation, student training, and validation, followed by recurring student inference, retries, and escalation. The video-judge team chose a smaller model for lower evaluation latency, accepting lower quality than a tested larger model.

For a fixed operating horizon, compare total costs under the same completed-task definition and quality gates. Lower recurring cost only recovers the transfer investment after sufficient use; more escalation can erase that advantage. AI Cost and Performance Engineering develops the broader accounting.

Instacart's semantic role labeling extracts product, brand, and attribute concepts from search queries. Its teacher pipeline populated a frequent-query cache and supplied data for a Llama-3-8B student serving uncached queries. The report describes similar F1, a combined precision–recall score, alongside different precision and recall. Similar aggregate quality therefore concealed different error balances.

Meeting the latency target also required adapter merging—folding task-specific learned adjustments into the model—and a hardware upgrade. FP8 quantization reduced latency further but lowered recall, so the team deployed without it. The result belongs to a complete configuration, not distillation alone; undisclosed transfer-data composition limits conclusions about long-tail training coverage.

Release requires the declared behavioral and resource limits before selecting the lowest-cost candidate. Reassess when workload, teacher, targets, student, or serving configuration changes: prior evidence describes its tested conditions. Evaluation records and reassessment connect each decision to the configuration and outcomes that support it.

Open questions

  1. Partial-distribution transfer remains sensitive to missing alternatives. Top-k interfaces reduce available supervision, but omitted mass can alter the learned target. Progress requires comparisons that vary truncation while holding teacher, student, and inputs fixed, measuring both distribution fidelity and independent correctness.

  2. Useful rationale supervision need not be faithful explanation. Separating procedural learning from imitation of hidden answer cues remains difficult. Progress would show gains on unseen problems while interventions on irrelevant hints no longer change answers through unacknowledged shortcuts.

  3. Hint filtering still lacks a general guarantee against inaccessible-information shortcuts. Procedural guidance may help, yet deciding what a student could discover depends on its deployed tools and observations. Progress requires leakage tests that withhold diagnoses while preserving legitimate discovery paths.

Follow the curated reading path through the speakers and demonstrations behind this entry.

23 min

AI Engineer World's Fair 2026 · 2026

Evaling Video Slop

Maor Bril

Cited in this entry

Provides a specialist-judge example where model quality, evaluation delay, and maintenance costs shape the distillation decision.

Watch talk

Explore more talks

The rest of the library, beyond the curated path. Cited talks support this entry; reviewed transcripts were processed in full. Metadata candidates have not been reviewed as sources or verified as topic members.

14 matching talks

TalkSpeakerEventYear
Vibhu SapraAI Engineer World's Fair 20252025
Ishan AnandAI Engineer World's Fair 20242024
Low Level Technicals of LLMs

Transcript reviewed

Daniel HanAI Engineer World's Fair 20242024
Scaling Compute on Context

Transcript reviewed

Jack MorrisAI Engineer World's Fair 20262026
Mahmoud MabroukAI Engineer Europe 20262026
Kyle KranenAI Engineer World's Fair 20252025
Mozhgan Kabiri ChimehAI Engineer Europe 20262026
Bertrand CharpentierAI Engineer Europe 20262026
Samuel DentonAI Engineer World's Fair 20262026
Ben KunkleAI Engineer Europe 20262026
Vivek TrivedyAI Engineer World's Fair 20262026
Ilan BigioAI Engineer World's Fair 20252025
RL Environments at Scale

Metadata candidate

Will BrownAI Engineer Code 20252025
Ziv IlanAI Engineer Europe 20262026

References

Coverage and source review
Processed transcripts
13 processed in full · 5 in the curated path
Automated source review
Passed
Metadata candidates
6 unreviewed; not verified topic membership
Corpus version
1bd8e407b26a07b33815594e1b2db5f41827119a2b3cb6fbf240f9fc571fc767

Automated review checks source support; it is not publication approval.

A synthesis of selected conference talks and technical references. Citations link to the source material; they do not imply that every talk on this subject is included.

  1. Distilling the Knowledge in a Neural Network

    Sections 1–2 and 4: foundational roles, supervision, transfer inputs, temperature and deployment separation.

  2. PyTorch: Training a Classifier

    Training an image classifier, steps 1–5, especially Net.forward, CrossEntropyLoss, training loop, and test-set evaluation.

  3. DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

    Sections 2.2.2–2.4 of the original report.

  4. Born-Again Neural Networks

    Sections 3–4: identical-architecture students, cross-architecture transfer and bounded experimental outcomes.

  5. Does Knowledge Distillation Really Work?

    Sections 3.2–6, especially the fidelity metrics, CIFAR-100 interventions and diagnostic hypotheses.

  6. Demystifying evals for AI agents

    Primary engineering report; evaluation structure, grader types, and capability versus regression suites.

  7. Unifying Distillation and Privileged Information

    Section 4: separate teacher and student inputs and sequential target construction.

  8. Weak supervision needs evaluation beyond supervisor agreement

    Section 3 methodology and limitations; Sections 4.1 and 4.3 results; Section 5.1 and Figures 6–7 imitation and overfitting analyses.

  9. Model Compression via Distillation and Quantization

    Introduction and sections 2–3; contextual distinction only, with algorithms reserved for /topics/quantization.

  10. Towards Cross-Tokenizer Distillation: the Universal Logit Distillation Loss for LLMs

    Sections 2.1–2.4: supervision access and vocabulary compatibility; contextual link: /topics/tokenization#section-9.

  11. Attention Is All You Need: token representations and next-token probabilities

    Sections 3.1–3.5: decoder architecture, masked attention, feed-forward networks, embeddings, softmax and positional encoding.

  12. Sequence-Level Knowledge Distillation

    Sections 3.2–4: precomputed sequence targets, reference-based selection and experimental baselines. Complements the reused on-policy note.

  13. TRL v1.7.0: Distillation Trainer

    Usage tips, external teacher server and expected dataset sections; inspected documentation only.

  14. FitNets: Hints for Thin Deep Nets

    Section 2.2: hidden-layer targets, dimensional correspondence, regression loss and training constraints.

  15. On Calibration of Modern Neural Networks

    Sections 2–4: calibration definition, reliability diagrams, ECE, and held-out calibration. Comparison with selective prediction uses its separately cited definitions.

  16. Transformers T5 documentation: Training

    Training section and tokenizer padding-token definition; historical versioned documentation used for stable terminology.

  17. SFT Trainer: objective, shifting, and masking

    Official implementation documentation, method and masking sections.

  18. Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes

    Sections 3–4: rationale supervision, student initialization, independent baselines and specialization.

  19. Reasoning Models Don't Always Say What They Think

    Original research team's report: hint interventions and faithfulness experiments.

  20. On-Policy Distillation of Language Models: Learning from Self-Generated Mistakes

    Sections 2–3, equations 2–4, algorithm 1.

  21. Modern Post-Training: A Deep Dive — Will Brown, Prime Intellect

    Score already-generated sequences with the teacher and use the resulting reference log probabilities as the distillation signal.

  22. Modern Post-Training: A Deep Dive — Will Brown, Prime Intellect

    On-policy distillation uses environment rollouts but scores them using teacher likelihoods rather than the ordinary reward signal.

  23. Modern Post-Training: A Deep Dive — Will Brown, Prime Intellect

    Treat SFT data generation as collecting teacher rollouts in an environment rather than constructing a separate chain of dataset conversions.

  24. Statistics Canada Quality Guidelines: Coverage and frames

    Scope, principles and guidelines; foundational population, sampling-frame and coverage vocabulary.

  25. NIST AI RMF Playbook: Measure

    MEASURE 2.2 representative population and collection context; MEASURE 2.5 validity, reliability and generalization limitations.

  26. Documenting Large Webtext Corpora: A Case Study on the Colossal Clean Crawled Corpus

    Sections 5.1–5.3 and recommendations; empirical example for cleaning and coverage.

  27. How to construct domain-specific LLM evaluation systems.

    Use an LLM to role-play the target user and generate inputs across application features, scenarios, and tools.

  28. Cross-validation and held-out evaluation

    Section 3.1 introductory discussion of overfitting, validation and test sets; Section 3.1.1 Data transformation with held-out data.

  29. Scaling up Continual Learning

    On-policy self-distillation (OPSD) uses a privileged-information prompt to make the same model a better-informed teacher, then trains the unhinted student against it.

  30. Modern Post-Training: A Deep Dive — Will Brown, Prime Intellect

    Give the teacher a hint-enriched prompt, then align its scores back to the original sequence.

  31. Scaling up Continual Learning

    Hints can teach the student to skip reasoning steps by relying on information unavailable during real execution.

  32. How to construct domain-specific LLM evaluation systems.

    Use evaluation results to select promising examples for human review and route failed cases through a continuing curation workflow.

  33. Language Models (Mostly) Know What They Know

    Sections 1–4, section 5.2, Appendix A.1–A.3 and Appendix B; verbal-confidence and repeatability implications are explicitly identified as engineering interpretation.

  34. PROV-DM: The PROV Data Model

    Introduction; core entities, activities, agents and derivations; section 7 on changing resources.

  35. NIST AI 100-4: Reducing Risks Posed by Synthetic Content

    Sections 3.1.1–3.2, 4.2, and 5.2–5.5; Appendix F authentication definition.

  36. On the Efficacy of Knowledge Distillation

    Sections 5.1–5.2: teacher size, student accuracy and transfer-fit diagnostics.

  37. Modern Post-Training: A Deep Dive — Will Brown, Prime Intellect

    The speaker factors methods by who generates the rollout and how training scores or advantages are assigned.

  38. Introduction to Information Retrieval: Precision and recall

    Textbook definitions, equations 38–39. Field-value matching and abstention consequences are a direct application of those set definitions, not a reported extraction experiment.

  39. Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena

    Sections 3.1, 3.3–3.4 and 4.1–4.3; Appendix B bias examples; Appendix D.3 agreement evaluation.

  40. Can You Trust Your Model’s Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shift

    Section 3, uncertainty metrics and ECE; section 4, shifted-data experiments; section 5, takeaways and recommendations.

  41. Hacking the Inference Pareto Frontier

    Set required quality and latency from the application experience, then minimize cost within those constraints.

  42. Running LLMs locally: Practical LLM Performance on DGX Spark — Mozhgan Kabiri chimeh, NVIDIA

    Measure response onset directly in the streaming client instead of relying only on completed-request latency or generation throughput.

  43. Evaling Video Slop

    The team chose a small Qwen VLM to reduce evaluation latency, accepting lower quality than a tested larger model; distillation is an economic choice rather than a prerequisite for evaluation.

  44. Building the Intent Engine: How Instacart Is Revamping Query Understanding with LLMs

    Semantic Role Labeling, Distilling Knowledge via Fine-Tuning and Path to Production sections; bounded first-party specialization example.

  45. Scaling up Continual Learning

    OPSD supplies vocabulary-wide feedback at each token position without requiring a group of competing rollouts.

  46. Scaling up Continual Learning

    Residual guidance uses partial-hint and full-hint teachers to moderate how far privileged information shifts the training target.

  47. How Instacart transformed its search and discovery using an LLM-driven approach

    A concentrated query distribution supported batch generation and cached serving, with fallback models for uncovered queries.