arXiv Analytics

Sign in

arXiv:2211.03646 [cs.CV]AbstractReferencesReviewsResources

Contrastive Classification and Representation Learning with Probabilistic Interpretation

Rahaf Aljundi, Yash Patel, Milan Sulc, Daniel Olmeda, Nikolay Chumerin

Published 2022-11-07Version 1

Cross entropy loss has served as the main objective function for classification-based tasks. Widely deployed for learning neural network classifiers, it shows both effectiveness and a probabilistic interpretation. Recently, after the success of self supervised contrastive representation learning methods, supervised contrastive methods have been proposed to learn representations and have shown superior and more robust performance, compared to solely training with cross entropy loss. However, cross entropy loss is still needed to train the final classification layer. In this work, we investigate the possibility of learning both the representation and the classifier using one objective function that combines the robustness of contrastive learning and the probabilistic interpretation of cross entropy loss. First, we revisit a previously proposed contrastive-based objective function that approximates cross entropy loss and present a simple extension to learn the classifier jointly. Second, we propose a new version of the supervised contrastive training that learns jointly the parameters of the classifier and the backbone of the network. We empirically show that our proposed objective functions show a significant improvement over the standard cross entropy loss with more training stability and robustness in various challenging settings.

Related articles: Most relevant | Search more
arXiv:2012.04837 [cs.CV] (Published 2020-12-09)
Deep Unsupervised Image Anomaly Detection: An Information Theoretic Framework
arXiv:1506.07613 [cs.CV] (Published 2015-06-25)
Generalized Majorization-Minimization
arXiv:1511.05643 [cs.CV] (Published 2015-11-18)
A New Smooth Approximation to the Zero One Loss with a Probabilistic Interpretation