Label Smoothing in Classification Models
A classification model is often trained as if the correct class deserves all of the target probability and every other class deserves none. For a three-class problem, an example labeled cat might therefore use this target: cat: 1.00 dog: 0.00 fox: 0.00 That target is convenient, but it asks the model to push probability toward an extreme even when labels are imperfect, classes overlap, or the input is genuinely ambiguous. Label smoothing changes the training target so that a small amount of probability mass is assigned away from the labeled class.