Foundations of Knowledge Distillation
Q1 [Basic] Explain the motivation for soft targets
Q: Why do soft targets from a teacher network provide richer training signal than one-hot labels?
A: One-hot labels encode only which class is correct, discarding all information about relative similarity among incorrect classes. A teacher’s output distribution, by contrast, assigns non-trivial probabilities to related classes — a cat image may receive modest probability mass on “tiger” and near-zero on “truck” — reflecting learned similarity structure absent from the ground-truth label.
Hinton et al. (2015) formalized this intuition in the modern knowledge distillation framework. When a student minimizes the cross-entropy with the teacher’s softened distribution, it receives a rich gradient signal that constrains its representations toward the teacher’s internal geometry, not just its top-1 decision. Each soft target compactly encodes what the teacher has learned about inter-class relationships across its entire training set.
Empirically, soft targets are most informative when the teacher assigns significant probability mass to “dark knowledge” classes — predictions about classes other than the correct one. On MNIST, Hinton et al. (2015) demonstrated that a distilled model generalized to the digit “3” even though the teacher had never been trained on “3”, because the soft targets for other digits implicitly conveyed visual structure relevant to “3.”
Q2 [Basic] Describe temperature scaling in knowledge distillation
Q: How does the temperature hyperparameter control the sharpness of the teacher’s distribution, and why is a scaling factor applied to the distillation loss?
A: Standard softmax converts logits $z_i$ to probabilities $p_i = \exp(z_i) / \sum_j \exp(z_j)$. Temperature-scaled softmax divides each logit by $T$ before the softmax: $p_i^{(T)} = \exp(z_i / T) / \sum_j \exp(z_j / T)$. At $T = 1$ this recovers the standard distribution; at $T > 1$ the distribution becomes more uniform, raising the probability on non-maximal classes.
The full distillation loss combines a hard-label cross-entropy term with a soft-label KL divergence:
$$\mathcal{L}_\text{KD} = (1 - \alpha)\,\mathcal{L}_\text{CE}(y,\, p_S) + \alpha\, T^2\,\mathrm{KL}\!\left(p_T^{(T)} \,\Big\|\, p_S^{(T)}\right)$$The factor $T^2$ compensates for the gradient attenuation that occurs when both distributions are softened: the gradients of the KL term with respect to logits scale as $1/T^2$, so multiplying by $T^2$ restores them to the same order of magnitude as the cross-entropy gradients (Hinton et al., 2015).
In practice, $T$ is tuned in the range $[2, 20]$. Higher values expose more dark knowledge but also add noise from near-uniform distributions, so the optimal $T$ depends on teacher confidence and task difficulty.
Q3 [Basic] Compare the three main families of knowledge distillation
Q: How do response-based, feature-based, and relation-based distillation differ in what they transfer from teacher to student?
A: Response-based distillation transfers the teacher’s final output — the logit vector or class probabilities. The student is trained to match these soft targets, capturing the teacher’s decision boundary. The Hinton et al. (2015) framework is the canonical example.
Feature-based distillation transfers intermediate representations: hidden-layer activations, attention maps, or feature pyramid outputs. FitNets (Romero et al., 2015) introduced “hint” layers, where a student layer is regressed toward a corresponding teacher layer via an auxiliary MSE loss. This family assumes intermediate representations carry information not recoverable from final logits alone — a reasonable assumption when the teacher’s early layers encode disentangled visual primitives.
Relation-based distillation transfers structural relationships among examples rather than individual activations. Rather than matching $f_S(x) \approx f_T(x)$ instance-by-instance, relational methods match pairwise distances $d(f_T(x_i), f_T(x_j)) \approx d(f_S(x_i), f_S(x_j))$ or higher-order angular relationships across sets of examples (Park et al., 2019). This is architecture-agnostic in a deeper sense: it imposes no requirement on the dimension or structure of student and teacher embeddings.
In practice these families are combined: a total loss typically includes a soft-label term, one or more feature-matching terms, and a relational term, each weighted by separate hyperparameters.
Q4 [Advanced] Contrast forward and reverse KL for sequence generation
Q: What are the implications of minimizing forward KL versus reverse KL between teacher and student distributions, particularly for auto-regressive text generation?
A: The two directions of KL divergence have fundamentally different support-coverage behaviors. Forward KL, $\mathrm{KL}(p_T \| p_S)$, is mean-seeking: where the teacher $p_T$ places mass, the student $p_S$ must also do so or incur infinite loss (in the continuous case). The student therefore covers all teacher modes, spreading probability mass even into low-confidence regions and producing overdisperse distributions.
Reverse KL, $\mathrm{KL}(p_S \| p_T)$, is mode-seeking: the student is penalized only where it places mass outside the teacher’s support and will commit to a single high-probability mode rather than cover all of them.
For classification tasks, both objectives converge to nearly the same solution because the teacher distribution has a single dominant peak. For auto-regressive language generation the distinction is critical: at each decoding step, $p_T(\cdot|x_{ MiniLLM (Gu et al., 2024) demonstrated that switching to reverse KL with policy gradient optimization substantially improves open-ended generation quality when distilling GPT-2-XL into smaller GPT-2 variants. The computational cost is higher because reverse KL requires on-policy sampling from the student to compute the gradient, whereas forward KD requires only teacher-forced forward passes. GKD (Agarwal et al., 2024) generalizes this analysis to a family of $f$-divergences parameterized to interpolate between forward and reverse KL, showing that intermediate choices can outperform either extreme on specific tasks by balancing coverage against mode-seeking behavior. Q: How does FitNets extend knowledge distillation to intermediate layers, and why is a separate regressor necessary? A: FitNets (Romero et al., 2015) extended response-based KD to intermediate representations by designating a “guided” layer in the student and a corresponding “hint” layer in the teacher. The student’s guided layer is trained to minimize the MSE between its feature map and the teacher’s hint feature map. A practical difficulty is that the guided and hint layers typically have different spatial dimensions and channel counts. FitNets resolves this with a learned linear regressor $r(\cdot;\, W_r)$ applied to the student feature map before computing the loss: Training proceeds in two stages: first the student’s lower layers are pre-trained to match the teacher’s hint layers via this loss; then the full student is fine-tuned end-to-end using the combined distillation loss. The two-stage procedure prevents the hint loss from dominating the final soft-label objective early in training. FitNets showed that thinner, deeper student networks — fewer parameters but more layers than the teacher — can match or exceed teacher performance on CIFAR-10, provided intermediate supervision guides the early layers toward useful representations. Q: How does Attention Transfer define and distill spatial attention maps, and what aspect of the teacher’s computation does it preserve? A: Attention Transfer (AT; Zagoruyko & Komodakis, 2017) distills spatial attention maps — compact summaries of which locations a network focuses on for a given input. Given an activation tensor $A \in \mathbb{R}^{C \times H \times W}$, the attention map is the sum of squared activations across channels: The student is trained to match the $\ell_2$-normalized teacher attention map at each corresponding layer: This is added to the standard cross-entropy loss. Zagoruyko & Komodakis (2017) reported that a WRN-16-2 student trained with AT from a WRN-40-2 teacher achieves 2.33% error on CIFAR-10, closely tracking the teacher’s 2.24% at roughly one-quarter of the teacher’s parameter count. AT is computationally lightweight and architecture-agnostic with respect to channel count: since the maps are collapsed over channels before the loss is applied, student and teacher need not share channel dimensions. Q: What objective does CRD optimize, and why does framing distillation as mutual information maximization outperform direct activation matching? A: Contrastive Representation Distillation (CRD; Tian et al., 2020) reframes knowledge transfer as maximizing the mutual information $I(f_T(x);\, f_S(x))$ between teacher and student representations. Direct activation matching (MSE between $f_T(x)$ and $f_S(x)$) implicitly assumes a Gaussian or linear relationship between the two embedding spaces — an assumption that fails when teacher and student architectures are heterogeneous (e.g., ResNet teacher, MobileNet student). Mutual information maximization makes no such distributional assumption. CRD uses a contrastive objective to lower-bound mutual information. For a positive pair $(f_T(x), f_S(x))$ and $M$ negatives drawn from a memory bank, the loss is: where $h$ is a learned bilinear critic. The student’s representation is encouraged to be predictive of the teacher’s representation for the same input while remaining distinct from representations of different inputs. Tian et al. (2020) reported 72.61% on CIFAR-100 when distilling from ResNet-32x4 to ShuffleNetV2, surpassing all prior feature-based methods on that benchmark. A key property is that the bound tightens with larger memory banks — more negatives provide better contrast — so CRD naturally benefits from scale in a way that direct activation matching does not. CRD also extends naturally to multi-teacher distillation: separate contrastive objectives can be applied per teacher, encouraging the student’s representations to be simultaneously predictive of all teachers without explicit feature-dimension alignment. Q: How does RKD transfer structural information that instance-level matching cannot, and what are its practical trade-offs? A: Instance-level distillation — soft logits, FitNets, CRD — treats each input independently: the student produces an output or representation for $x$ that is compared against the teacher’s for the same $x$. Relational Knowledge Distillation (RKD; Park et al., 2019) instead transfers the metric structure of the teacher’s embedding space by matching relationships among sets of examples. RKD defines two losses operating over pairs and triplets. The distance-wise loss penalizes discrepancies in pairwise distances: where $\psi$ is a normalizing function and $\ell_\delta$ is the Huber loss. The angle-wise loss penalizes discrepancies in triplet angles, encoding second-order relational geometry across example triples. Because RKD cares only about relative geometry, it imposes no constraint on absolute embedding dimensionality, making it well-suited for cross-architecture transfer (e.g., ResNet teacher to MobileNet student) where feature dimensions are incompatible by design. The practical limitations are computational: pairs scale as $O(N^2)$ per mini-batch, and triplets as $O(N^3)$, though sampled subsets are used in practice. More fundamentally, RKD provides no guarantee about absolute embedding quality — only that inter-example relationships are preserved. For downstream tasks that rely on absolute embedding distances (nearest-neighbor retrieval, linear probing), instance-level methods complement RKD by anchoring individual representations even as relational losses shape the global geometry. Q: What training objectives does DistilBERT use to distill BERT, and what are the resulting size and performance trade-offs? A: DistilBERT (Sanh et al., 2019) reduces BERT-base from 12 Transformer layers to 6, retaining each layer’s hidden dimension (768) and removing the token-type embeddings and pooler. The resulting model has 40% fewer parameters and runs 60% faster than BERT-base at inference. Training combines three objectives: (1) masked language modeling loss $\mathcal{L}_\text{MLM}$; (2) soft-label cross-entropy $\mathcal{L}_\text{soft}$ matching the teacher’s token-level probability distributions; and (3) cosine embedding loss $\mathcal{L}_\text{cos}$ encouraging the student’s hidden-state vectors to align directionally with the teacher’s. The student is initialized by copying every other layer of BERT-base, warm-starting from the teacher’s weight space. On the GLUE benchmark, DistilBERT retains 97% of BERT-base’s performance across tasks (Sanh et al., 2019). The largest gaps appear on tasks requiring long-range multi-step reasoning, where the reduction from 12 to 6 layers is most costly. DistilBERT established that task-agnostic distillation — compressing on the general pre-training corpus rather than per-task fine-tuned data — is viable, which became the dominant paradigm for deploying language models in resource-constrained settings. Q: What additional distillation signals does TinyBERT introduce beyond soft logits, and what makes the layer mapping non-trivial? A: TinyBERT (Jiao et al., 2020) performs fine-grained distillation at four levels: (1) embedding layer, (2) Transformer layer attention matrices, (3) Transformer layer hidden states, and (4) prediction layer soft logits. This is considerably more granular than DistilBERT, which uses soft token-level logits and directional hidden-state alignment but does not separately supervise attention distributions or distinguish attention from FFN contributions. The combined Transformer-layer loss for student layer $m$ mapped to teacher layer $n$ is: where $A^i$ is the attention matrix for head $i$ and $H$ is the hidden state. A learned projection $W_h$ is required because TinyBERT$_4$ uses a hidden dimension of 312 versus BERT’s 768. The layer mapping $m \to n(m)$ is non-trivial when the student has fewer Transformer layers than the teacher. TinyBERT$_4$ maps to BERT-base via the uniform assignment $n(m) = 3m$. Jiao et al. (2020) use a two-stage procedure: general-domain distillation on large corpora, followed by task-specific distillation with data augmentation (using BERT as a generator to expand the fine-tuning set). TinyBERT$_4$ achieves 76.5 on GLUE while being $7.5\times$ smaller and $9.4\times$ faster than BERT-base at inference, with the task-specific augmentation step accounting for a substantial fraction of the gain over DistilBERT. Q: Why does forward KL cause mode-covering in sequence generation, and how does MiniLLM’s reverse KL objective address it? A: In token-level distillation for auto-regressive models, the standard approach minimizes:
Feature-based and Relation-based Methods
Q5 [Basic] Explain FitNets hint-layer distillation
Q6 [Basic] Describe Attention Transfer for convolutional networks
Q7 [Advanced] Analyze Contrastive Representation Distillation as mutual information maximization
Q8 [Advanced] Evaluate Relational Knowledge Distillation and its limitations
Language Model Distillation
Q9 [Basic] Summarize the DistilBERT compression strategy
Q10 [Advanced] Analyze TinyBERT’s layer-wise distillation
Q11 [Advanced] Explain MiniLLM’s approach to auto-regressive distillation
MiniLLM (Gu et al., 2024) instead minimizes the reverse KL:
$$\mathcal{L}_\text{rev} = \sum_{t} \mathrm{KL}\!\left(p_S(\cdot|x_{Computing the gradient of $\mathrm{KL}(p_S \| p_T)$ requires an expectation under the student’s distribution, not the teacher’s. MiniLLM uses policy gradient (REINFORCE with a teacher-provided baseline) to obtain unbiased gradient estimates from on-policy student samples — more expensive than forward KD, which requires only a single teacher forward pass. Gu et al. (2024) evaluated distillation from GPT-2-XL into GPT-2 variants (120M to 1.5B parameters) and reported consistent improvements on Dolly, Self-Instruct, and S-NI open-ended generation benchmarks over forward-KL baselines.
Q12 [Advanced] Compare black-box and white-box LLM distillation
Q: What information access does each paradigm assume, and how does this shape the methods, quality, and legal trade-offs involved?
A: White-box distillation assumes access to the teacher’s internal states: probability distributions over the vocabulary at each decoding step, hidden activations, or attention patterns. This enables richer transfer signals — token-level soft targets (as in DistilBERT and TinyBERT), intermediate layer supervision, or reverse-KL objectives (MiniLLM). The full token distribution carries far more information per training example than the single sampled token.
Black-box distillation assumes only API-level access: the student observes input-output text pairs but not probabilities or activations. The student is fine-tuned on teacher-generated completions — effectively supervised fine-tuning on teacher outputs. Projects like Stanford Alpaca and Vicuna demonstrated this paradigm: LLaMA-7B fine-tuned on GPT-3.5-turbo or GPT-4 completions acquires substantial instruction-following capability without access to teacher internals.
The central limitation of black-box distillation is information loss: the student trains on the teacher’s mode (greedy or sampled completion) rather than its full conditional distribution. For tasks with multiple valid continuations, the teacher’s probability mass over alternatives carries signal that is entirely discarded. Black-box distillation also raises legal concerns: many providers explicitly prohibit using API outputs to train competing models.
Hybrid approaches partially bridge the gap. Speculative decoding (Leviathan et al., 2023) trains a small draft model to approximate teacher token-by-token, using the teacher to verify drafts in parallel. GKD (Agarwal et al., 2024) enables on-policy distillation by providing access to a subset of teacher probability mass at training time, combining the tractability of white-box methods with the deployment flexibility of black-box ones.
Q13 [Advanced] Distinguish sequence-level from token-level knowledge distillation
Q: What information does sequence-level distillation capture that token-level distillation misses, and what are the computational trade-offs?
A: Token-level distillation trains the student to match the teacher’s conditional $p_T(x_t | x_{ The limitation is exposure bias: the student always sees teacher-forced prefixes at train time but generates autoregressively at inference, where early errors are compounded through subsequent steps. A student that perfectly matches each conditional under teacher forcing may still diverge severely in free-running generation. Sequence-level KD (Kim & Rush, 2016) addresses this by distilling the sequence distribution directly. The teacher generates complete sequences via beam search, and the student is trained to maximize $\log p_S(\hat{x})$ on this teacher-generated corpus. Because the training data consists of teacher outputs rather than teacher-forced prefixes, the student trains on sequences it will actually produce at inference — exposure bias is mitigated by construction. The trade-off is dataset cost: generating a sequence-level corpus requires running the teacher decoder over the full training set, which is expensive for large vocabularies and long sequences. Token-level distillation computes soft targets in a single forward pass. Online methods like MiniLLM (Gu et al., 2024) combine sequence-level thinking with continuous adaptation by sampling from the student during training, avoiding the one-time corpus cost while preserving on-policy distribution alignment. Q: How does DeiT incorporate teacher supervision into ViT training, and what type of teacher works best? A: DeiT (Touvron et al., 2021) trains Vision Transformers on ImageNet-1k without the massive external datasets required by the original ViT. The central mechanism is a distillation token: a learnable vector appended to the input patch sequence alongside the class token. Like the class token, the distillation token interacts with all patch tokens through self-attention and is projected to logits at the output — but it is supervised by the teacher’s prediction rather than the ground-truth label: where $y_T$ is the teacher’s top-1 prediction (hard distillation) or softened distribution (soft distillation). The two tokens interact through attention throughout the forward pass but receive independent supervision signals. Touvron et al. (2021) found that CNN teachers (specifically RegNetY-160) outperform transformer teachers for DeiT. This is attributed to inductive bias complementarity: a CNN teacher encodes translational equivariance that encourages the ViT student to develop local sensitivity, beneficial for ImageNet despite not being architecturally mandated. DeiT-B with a RegNetY-160 teacher achieves 85.2% top-1 accuracy on ImageNet, training only on ImageNet data — a result previously achievable only with JFT-pretrained ViTs. Q: When does a larger teacher produce a worse student, and how does the teacher assistant strategy address the root cause? A: The capacity gap problem arises when teacher and student architectures differ substantially in size. Despite the intuition that a stronger teacher should always produce a better student, Mirzadeh et al. (2020) showed empirically on CIFAR-10/100 and ImageNet that student accuracy peaks at an intermediate teacher size and then declines as the teacher grows beyond that optimum. A very large teacher’s decision surface may be too complex for a small student to approximate — the distillation gradient becomes poorly conditioned and the student converges to a suboptimal solution. The Teacher Assistant (TA) strategy inserts intermediate-capacity networks between teacher and student: $T \to TA \to S$. Each step compresses by a smaller factor, keeping the capacity gap manageable at each stage. For a teacher with $N_T$ parameters and a student with $N_S$, a single TA with $N_{TA} \approx \sqrt{N_T \cdot N_S}$ (geometric mean) equalizes the two compression ratios. Mirzadeh et al. (2020) demonstrated consistent gains across architectures: for a WRN-40-2 teacher and WRN-16-1 student on CIFAR-100, interposing a WRN-40-1 TA raised the student’s top-1 accuracy by approximately 1.2 points. The improvement persists across multiple layers of assistants, though returns diminish. The main practical cost is a multiplied training budget: the TA itself must be distilled from the teacher before the final student can be trained, effectively chaining $k$ distillation runs for $k-1$ assistants. This makes TA most justified when the primary bottleneck is distillation quality rather than training time, and when the teacher-student capacity ratio substantially exceeds $10\times$. Q: How do object detection and segmentation tasks complicate knowledge transfer compared to image classification, and what strategies address these complications? A: Classification distillation transfers a fixed-length logit vector per image. Dense prediction models produce spatially-structured outputs — bounding boxes and class scores over feature pyramid levels for detection, or pixel-wise segmentation maps — and the intermediate feature maps driving localization quality are as important as the final classification heads. Naively applying soft logit matching (Hinton et al., 2015) to detection heads ignores the backbone features that encode spatial context critical to localization. A core complication is foreground-background imbalance in feature-space distillation. A naive FitNets-style loss applied to backbone spatial features forces the student to replicate activations at all $H \times W$ positions, the vast majority of which correspond to background. This floods the gradient with low-information signal and dilutes supervision from the handful of foreground locations the student most needs to learn. Wang et al. (2019) showed that weighting distillation losses by predicted foreground probability — applying larger penalties in regions the teacher identifies as object-containing — significantly improves transfer for two-stage detectors. For multi-scale architectures, distillation losses applied at the feature pyramid network (FPN) outputs, rather than backbone features alone, transfer multi-scale context more effectively because FPN features directly feed the detection heads. Matching across architectures with different backbone strides requires careful spatial alignment of teacher and student feature maps. For dense segmentation, matching $H \times W$ pixel-wise activations is memory-intensive. Selective distillation at semantically significant spatial locations — identified via the teacher’s own confidence or attention patterns — reduces memory cost while focusing supervision on the positions most responsible for accurate boundary delineation. Q: How does DINO apply distillation without labels to learn visual representations, and what makes its attention maps emergently interpretable? A: DINO (Caron et al., 2021) — Distillation with No labels — trains a student ViT to match the outputs of a momentum teacher: an exponential moving average (EMA) of the student weights that is never directly updated by gradient descent: where $m$ increases from 0.996 to 1 during training. The teacher thus provides a temporally stable target slightly ahead of the student in representation quality, avoiding the instability of symmetric mutual learning. The training objective is a cross-entropy between the student’s output over strongly-augmented views of an image and the teacher’s output over a weakly-augmented view. A centering operation — subtracting a running mean from teacher outputs — prevents dimensional collapse without requiring negative pairs, contrastive loss, or explicit regularization. No labels are used at any point. A remarkable emergent property is that DINO’s last-layer self-attention heads segment foreground objects with high accuracy despite receiving no segmentation supervision. Each head attends to a different semantically coherent region, and combining them recovers object masks comparable to supervised segmentation baselines on some benchmarks. Caron et al. (2021) reported that a frozen ViT-S/8 trained with DINO achieves 74.5% top-1 accuracy on ImageNet via $k$-NN classification. From a distillation perspective, DINO demonstrates that the student-teacher asymmetry — strong augmentation for the student, weak augmentation for the teacher — combined with EMA stabilization constitutes a self-supervised signal powerful enough to learn transferable visual representations without any external teacher or label. Q: How does online distillation remove the dependency on a pre-trained teacher, and what are the trade-offs relative to offline approaches? A: In offline distillation, the pipeline is sequential: train a large teacher to convergence, freeze it, then distill into a student. The teacher’s predictions are static throughout student training and represent a fixed quality ceiling. Online distillation trains teacher and student (or multiple peer networks) simultaneously, removing the requirement for a pre-trained teacher. Deep Mutual Learning (DML; Zhang et al., 2018) is the canonical example: two networks of the same architecture are co-trained, each minimizing cross-entropy on labels plus KL divergence toward the other’s current predictions. Neither network is frozen; both improve through mutual supervision throughout training. The advantage of online distillation is that no large pre-trained model is needed, which lowers the total training budget. The disadvantage is that early in training both networks are weak, so the soft targets they exchange may carry little useful information or may even be misleading. Offline distillation from a fully converged, high-capacity teacher provides a stable and strong training signal from the first iteration. Hybrid approaches partially reconcile these trade-offs by building a slowly-moving teacher as an EMA of student checkpoints — the teacher is updated throughout training, but stably enough to provide high-quality soft targets. This is the mechanism DINO (Caron et al., 2021) uses in the self-supervised setting and is closely related to mean-teacher approaches in semi-supervised learning. Q: What does the success of Born Again Networks reveal about the role of soft targets in knowledge distillation? A: Born Again Networks (BAN; Furlanello et al., 2018) challenge the standard justification for knowledge distillation. The conventional account holds that a larger, more accurate teacher transfers superior knowledge the student could not acquire from labels alone. BANs refute this by showing that a student of identical architecture and capacity surpasses its teacher when trained with KD from that teacher — a result that cannot be explained by superior teacher knowledge, since the student has the same representational capacity. The improvement persists across generations: a BAN generation-1 student outperforms the original teacher, and an ensemble of $k$ BAN generations improves further (Furlanello et al., 2018), though gains diminish with each generation and eventually plateau. Several mechanisms have been proposed to explain the improvement. First, soft targets provide implicit label smoothing: rather than hard 0/1 labels, the student trains against a distribution that penalizes overconfident predictions and yields lower-variance gradient estimates near the decision boundary. Second, the inter-class structure in soft targets encodes dark knowledge — learned inter-class similarities — that constrains the student toward generalization-favoring parameter regions absent from one-hot training. Third, the soft-label objective may distort the loss landscape in ways that favor flatter loss basins with better test generalization, even when the teacher’s test accuracy matches what the student’s capacity would permit under standard training. The practical implication is that self-distillation is a competitive regularizer even without a larger teacher, often matching or outperforming dropout and label smoothing in specific architectures. It also motivates iterative distillation schedules for further squeezing performance from a fixed-capacity network. Q: Why is data-free distillation fundamentally harder than standard KD, and how have generative adversarial approaches addressed the core challenge? A: Standard knowledge distillation requires data to run through the teacher and obtain soft targets. Data-free KD must perform distillation without access to any real training data — a setting motivated by privacy constraints, licensing restrictions, or scenarios where the original training set is unavailable after deployment. The core difficulty is that without inputs, the teacher’s knowledge is inaccessible: its soft targets, intermediate activations, and attention maps are all conditioned on data. The student cannot compute any distillation gradient without first synthesizing inputs that activate the teacher meaningfully. Early methods (Lopes et al., 2017) stored activation statistics — per-layer mean activations and covariance matrices — during teacher training, then reconstructed synthetic training images from these metadata at distillation time. This avoids storing raw data but requires metadata collection upfront. Generative adversarial approaches avoid this by training a generator $G$ jointly with the student. DAFL (Fang et al., 2019) minimizes a combined objective: where $\mathcal{L}_\text{one-hot}$ rewards generating images the teacher classifies with high confidence (encouraging class-discriminative synthesis), and $\mathcal{L}_\text{ie}$ rewards information entropy across classes (preventing the generator from collapsing to a single easy class). The student trains on teacher outputs for the generated inputs. The persistent challenge is generator mode collapse: without diversity constraints, $G$ tends to produce a small set of synthetic images that maximize teacher confidence, covering only a subset of the teacher’s decision surface. Recent approaches use batch normalization statistics from the teacher as a proxy for the real data distribution — these statistics are accessible even without the training data — to regularize the generator toward producing activations that match the feature distribution the teacher was trained on, substantially improving coverage and downstream distillation quality.
Vision Model Distillation
Q14 [Basic] Explain DeiT’s distillation token mechanism
Q15 [Advanced] Analyze the capacity gap problem and teacher assistant distillation
Q16 [Advanced] Identify challenges in distilling dense prediction models
Q17 [Advanced] Explain DINO as a self-supervised self-distillation framework
Frontiers and Open Problems
Q18 [Basic] Contrast online and offline knowledge distillation
Q19 [Advanced] Explain why Born Again Networks improve over same-capacity teachers
Q20 [Advanced] Analyze data-free knowledge distillation and generative strategies
Quick Reference
#
Difficulty
Topic
Section
Q1
Basic
Motivation for soft targets
Foundations
Q2
Basic
Temperature scaling and loss scaling
Foundations
Q3
Basic
Response-, feature-, relation-based KD
Foundations
Q4
Advanced
Forward vs. reverse KL for generation
Foundations
Q5
Basic
FitNets hint-layer distillation
Feature-based and Relation-based Methods
Q6
Basic
Attention Transfer
Feature-based and Relation-based Methods
Q7
Advanced
Contrastive Representation Distillation
Feature-based and Relation-based Methods
Q8
Advanced
Relational Knowledge Distillation
Feature-based and Relation-based Methods
Q9
Basic
DistilBERT compression
Language Model Distillation
Q10
Advanced
TinyBERT layer-wise distillation
Language Model Distillation
Q11
Advanced
MiniLLM reverse KL
Language Model Distillation
Q12
Advanced
Black-box vs. white-box LLM distillation
Language Model Distillation
Q13
Advanced
Sequence-level vs. token-level distillation
Language Model Distillation
Q14
Basic
DeiT distillation token
Vision Model Distillation
Q15
Advanced
Capacity gap and teacher assistant
Vision Model Distillation
Q16
Advanced
Dense prediction distillation
Vision Model Distillation
Q17
Advanced
DINO self-supervised distillation
Vision Model Distillation
Q18
Basic
Online vs. offline distillation
Frontiers and Open Problems
Q19
Advanced
Born Again Networks and soft-label regularization
Frontiers and Open Problems
Q20
Advanced
Data-free knowledge distillation
Frontiers and Open Problems
Resources