REVIEW 3 cited by
When Does Label Smoothing Help?
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
read the original abstract
The generalization and learning speed of a multi-class neural network can often be significantly improved by using soft targets that are a weighted average of the hard targets and the uniform distribution over labels. Smoothing the labels in this way prevents the network from becoming over-confident and label smoothing has been used in many state-of-the-art models, including image classification, language translation and speech recognition. Despite its widespread use, label smoothing is still poorly understood. Here we show empirically that in addition to improving generalization, label smoothing improves model calibration which can significantly improve beam-search. However, we also observe that if a teacher network is trained with label smoothing, knowledge distillation into a student network is much less effective. To explain these observations, we visualize how label smoothing changes the representations learned by the penultimate layer of the network. We show that label smoothing encourages the representations of training examples from the same class to group in tight clusters. This results in loss of information in the logits about resemblances between instances of different classes, which is necessary for distillation, but does not hurt generalization or calibration of the model's predictions.
Forward citations
Cited by 3 Pith papers
-
Instance-Wise Monotonic Calibration by Constrained Transformation
MCCT and MCCT-I fit monotone per-rank scale and bias parameters on sorted logits for calibration, but the claimed monotonicity theorem fails for logits with negative values.
-
Recurrent Deep Differentiable Logic Gate Networks
A recurrent version of differentiable logic gate networks nearly matches a GRU on a truncated WMT14 English-German task, as a proof of concept.
-
Data-Efficient Challenges in Visual Inductive Priors: A Retrospective
A retrospective of four data-limited computer vision challenges finds that ensembles and heavy augmentation, not novel inductive priors, drove winning performance.
Discussion (0). Continue with ORCID to comment.