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

Conference and Journal
1st author
Knowledge Distillation
Noisy Label Classification
Image Classification


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 ฯ„ . 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 ฯ„ increases and the label matching when ฯ„ 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 ฯ„ , mitigates the label noise. The code to reproduce the experiments is publicly available online at data/.

Experimental Results

์ˆ˜์‹. KL Divergence ๊ทนํ•œ๊ฐ’ ๋ณ€ํ™”
์ˆ˜์‹. KL Divergence์™€ MSE Loss์˜ ๊ด€๊ณ„