Pith. sign in

REVIEW 7 cited by

Comparing Kullback-Leibler Divergence and Mean Squared Error Loss in Knowledge Distillation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.08919 v1 pith:HCZDY465 submitted 2021-05-19 cs.LG cs.CV

Comparing Kullback-Leibler Divergence and Mean Squared Error Loss in Knowledge Distillation

classification cs.LG cs.CV
keywords lossmodeldivergencelogitdistillationknowledgematchingstudent
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Knowledge distillation (KD), transferring knowledge from a cumbersome teacher model to a lightweight student model, has been investigated to design efficient neural architectures. Generally, the objective function of KD is the Kullback-Leibler (KL) divergence loss between the softened probability distributions of the teacher model and the student model with the temperature scaling hyperparameter tau. Despite its widespread use, few studies have discussed the influence of such softening on generalization. Here, we theoretically show that the KL divergence loss focuses on the logit matching when tau increases and the label matching when tau goes to 0 and empirically show that the logit matching is positively correlated to performance improvement in general. From this observation, we consider an intuitive KD loss function, the mean squared error (MSE) between the logit vectors, so that the student model can directly learn the logit of the teacher model. The MSE loss outperforms the KL divergence loss, explained by the difference in the penultimate layer representations between the two losses. Furthermore, we show that sequential distillation can improve performance and that KD, particularly when using the KL divergence loss with small tau, mitigates the label noise. The code to reproduce the experiments is publicly available online at https://github.com/jhoon-oh/kd_data/.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning Through Noise: Why Subliminal Learning Works and When It Fails

    cs.LG 2026-05 unverdicted novelty 7.0

    Subliminal learning occurs via compatible auxiliary and class output heads on task-unrelated inputs, even with random hidden layers or architecture changes, with theory and upper bounds on failure.

  2. PACED: Distillation and On-Policy Self-Distillation at the Frontier of Student Competence

    cs.AI 2026-03 conditional novelty 7.0

    PACED applies student pass-rate weighting w(p)=p(1-p) to distillation, concentrating on the zone of proximal development and delivering up to +8.2 gains on AIME tasks with reduced forgetting.

  3. Balancing Usefulness and Naturalness: An LLM-based Curation Pipeline for Code Review Comments

    cs.SE 2026-07 conditional novelty 6.0

    Selective LLM reformulation guided by high-quality exemplars yields cleaner, more diverse code-review datasets that improve downstream comment generation and code refinement.

  4. Direct-to-Event Spiking Neural Network Transfer

    cs.NE 2026-05 unverdicted novelty 6.0

    This work provides the first systematic study of transferring direct-coded spiking neural networks to event-based representations while aiming to preserve accuracy and reduce energy use.

  5. CLIP-RD: Relative Distillation for Efficient CLIP Knowledge Distillation

    cs.CV 2026-03 unverdicted novelty 6.0

    CLIP-RD adds VRD for cross-modality distillation consistency and XRD for bidirectional cross-modal symmetry to align student embedding geometry more closely with the teacher, yielding a 0.8 percentage point gain over ...

  6. One-Shot Federated Clustering of Non-Independent Completely Distributed Data

    cs.LG 2026-01 reject novelty 4.0

    GOLD is a one-shot federated clustering framework that finds fine local subclusters, merges their centroids at several granularities on the server, and encodes the multi-granular partitions into an enhanced representa...

  7. ROBUST-WT: Robust Uncertainty-aware Segmentation Transform via Whitening and Training Enhancements

    cs.CV 2026-06 unverdicted novelty 2.0

    Training tweaks (augmentations, hybrid loss, scheduling, ablation flags) raise optic disc Dice from 0.939 (baseline epoch 5) to 0.956 (final epoch) on a fundus benchmark.