Towards noise contrastive estimation with soft targets for conditional models
Not on the map. Why?
Abstract (arXiv)
Soft targets combined with the cross-entropy loss have shown to improve generalization performance of deep neural networks on supervised classification tasks. The standard cross-entropy loss however assumes data to be categorically distributed, which may often not be the case in practice. In contrast, InfoNCE does not rely on such an explicit assumption but instead implicitly estimates the true conditional through negative sampling. Unfortunately, it cannot be combined with soft targets in its standard formulation, hindering its use in combination with sophisticated training strategies. In this paper, we address this limitation by proposing a loss function that is compatible with probabilistic targets. Our new soft target InfoNCE loss is conceptually simple, efficient to compute, and can be motivated through the framework of noise contrastive estimation. Using a toy example, we demonstrate shortcomings of the categorical distribution assumption of cross-entropy, and discuss implications of sampling from soft distributions. We observe that soft target InfoNCE performs on par with strong soft target cross-entropy baselines and outperforms hard target NLL and InfoNCE losses on popular benchmarks, including ImageNet. Finally, we provide a simple implementation of our loss, geared towards supervised classification and fully compatible with deep classification models trained with cross-entropy.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 32 of its 41 references that are in the map. First posted on arXiv 22 Apr 2024.
Builds on
32 of 41 references.
References · 32
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
- 2020Supervised Contrastive Learningcited by 2,829
20 more
- 2019Contrastive Multiview Codingcited by 1,301
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2018Deep Graph Infomaxcited by 1,106
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2019When Does Label Smoothing Help?cited by 988
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 673
- 2019On Variational Bounds of Mutual Informationcited by 559
- 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
- 2020Hard Negative Mixing for Contrastive Learningcited by 402
- 2020DeeperGCN: All You Need to Train Deeper GCNscited by 250
- 2021Contrastive Learning Inverts the Data Generating Processcited by 221
- 2016Exploring the Limits of Language Modelingcited by 173
- 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 146
- 2018Large Margin Deep Networks for Classificationcited by 112
- 2018Noise Contrastive Estimation and Negative Sampling for Conditional Models: Consistency and Statistical Efficiencycited by 105
- 2023Rethinking Negative Pairs in Code Searchcited by 14
- 2020The continuous categorical: a novel simplex-valued exponential familycited by 12
- 2020Uses and Abuses of the Cross-Entropy Loss: Case Studies in Modern Deep Learningcited by 10
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 2.
5 papers.
- 2025SPACE: Noise Contrastive Estimation Stabilizes Self-Play Fine-Tuning for Large Language Modelscited by 7
- 2024SoftCVI: Contrastive variational inference with self-generated soft labelscited by 1
- 2025Unifying Convolution and Attention via Convolutional Nearest Neighborscited by 1
- 2026Interpolation between Convolution and Attention via K-Nearest Neighborscited by 0
- 2026ShopX: A Foundation Model for Intent-to-Item Fulfillment in Agentic Shoppingcited by 0
- 2026ShopX: A Foundation Model for Intent-to-Item Fulfillment in Agentic Shopping30 Jun 2026
- 2026Interpolation between Convolution and Attention via K-Nearest Neighbors31 May 2026
- 2025SPACE: Noise Contrastive Estimation Stabilizes Self-Play Fine-Tuning for Large Language Models8 Dec 2025
- 2025Unifying Convolution and Attention via Convolutional Nearest Neighbors18 Nov 2025
- 2024SoftCVI: Contrastive variational inference with self-generated soft labels22 Jul 2024