Collision Cross-entropy for Soft Class Labels and Deep Clustering
Not on the map. Why?
Abstract (arXiv)
We propose "collision cross-entropy" as a robust alternative to Shannon's cross-entropy (CE) loss when class labels are represented by soft categorical distributions y. In general, soft labels can naturally represent ambiguous targets in classification. They are particularly relevant for self-labeled clustering methods, where latent pseudo-labels are jointly estimated with the model parameters and uncertainty is prevalent. In case of soft labels, Shannon's CE teaches the model predictions to reproduce the uncertainty in each training example, which inhibits the model's ability to learn and generalize from these examples. As an alternative loss, we propose the negative log of "collision probability" that maximizes the chance of equality between two random variables, predicted class and unknown true class. We show that it has the properties of a generalized CE. The proposed collision CE agrees with Shannon's CE for one-hot labels, but the training from soft labels differs. For example, unlike Shannon's CE, data points where y is a uniform distribution have zero contribution to the training. Collision CE significantly improves classification supervised by soft uncertain targets. Unlike Shannon's, collision CE is symmetric for y and network predictions, which is particularly relevant when both distributions are estimated in the context of self-labeled clustering. Focusing on discriminative deep clustering where self-labeling and entropy-based losses are dominant, we show that the use of collision CE improves the state-of-the-art. We also derive an efficient EM algorithm that significantly speeds up the pseudo-label estimation with collision CE.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 40 references that are in the map. First posted on arXiv 13 Mar 2023.
Builds on
17 of 40 references.
References · 17
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2019When Does Label Smoothing Help?cited by 985
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 461
- 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 454
- 2020SCAN: Learning to Classify Images without Labelscited by 351
5 more
- 2018Joint Optimization Framework for Learning with Noisy Labelscited by 293
- 2017Learning Discrete Representations via Information Maximizing Self-Augmented Trainingcited by 149
- 2017Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimizationcited by 113
- 2015Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networkscited by 94
- 2018Deep clustering: On the link between discriminative models and K-meanscited by 37
Built on by
Not cited yet.