Preserving Fine-Grain Feature Information in Classification via Entropic Regularization
Not on the map. Why?
Abstract (arXiv)
Labeling a classification dataset implies to define classes and associated coarse labels, that may approximate a smoother and more complicated ground truth. For example, natural images may contain multiple objects, only one of which is labeled in many vision datasets, or classes may result from the discretization of a regression problem. Using cross-entropy to train classification models on such coarse labels is likely to roughly cut through the feature space, potentially disregarding the most meaningful such features, in particular losing information on the underlying fine-grain task. In this paper we are interested in the problem of solving fine-grain classification or regression, using a model trained on coarse-grain labels only. We show that standard cross-entropy can lead to overfitting to coarse-related features. We introduce an entropy-based regularization to promote more diversity in the feature space of trained models, and empirically demonstrate the efficacy of this methodology to reach better performance on the fine-grain problems. Our results are supported through theoretical developments and empirical validation.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 38 references that are in the map. First posted on arXiv 7 Aug 2022.
Builds on
20 of 38 references.
References · 20
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2017Neural Discrete Representation Learningcited by 4,712
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2019When Does Label Smoothing Help?cited by 988
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 464
- 2020Why Do Better Loss Functions Lead to Less Transferable Features?cited by 73
8 more
- 2020Self-Distillation as Instance-Specific Label Smoothingcited by 71
- 2017On Loss Functions for Deep Neural Networks in Classificationcited by 68
- 2018Maximum-Entropy Fine-Grained Classificationcited by 65
- 2021Is Label Smoothing Truly Incompatible with Knowledge Distillation: An Empirical Studycited by 51
- 2020Generalized Entropy Regularization or: There's Nothing Special about Label Smoothingcited by 41
- 2019Revisiting Knowledge Distillation via Label Smoothing Regularizationcited by 29
- 2021DP-SSL: Towards Robust Semi-supervised Learning with A Few Labeled Samplescited by 18
- 2019Meta Learning with Differentiable Closed-form Solver for Fast Video Object Segmentationcited by 6
Built on by
Citing papers per year: 2024: 1.
1 paper.