Bayesian Self-Supervised Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Recent years have witnessed many successful applications of contrastive learning in diverse domains, yet its self-supervised version still remains many exciting challenges. As the negative samples are drawn from unlabeled datasets, a randomly selected sample may be actually a false negative to an anchor, leading to incorrect encoder training. This paper proposes a new self-supervised contrastive loss called the BCL loss that still uses random samples from the unlabeled data while correcting the resulting bias with importance weights. The key idea is to design the desired sampling distribution for sampling hard true negative samples under the Bayesian framework. The prominent advantage lies in that the desired sampling distribution is a parametric structure, with a location parameter for debiasing false negative and concentration parameter for mining hard negative, respectively. Experiments validate the effectiveness and superiority of the BCL loss.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 43 of its 72 references that are in the map. First posted on arXiv 27 Jan 2023.
Builds on
43 of 72 references.
References · 43
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2014Going Deeper with Convolutionscited by 4,241
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2020Supervised Contrastive Learningcited by 2,829
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,287
31 more
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,845
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
- 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,591
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2020Big Self-Supervised Models are Strong Semi-Supervised Learnerscited by 1,380
- 2019Contrastive Multiview Codingcited by 1,301
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 808
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
- 2020Self-supervised Learning: Generative or Contrastivecited by 694
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 673
- 2020Contrastive Learning with Hard Negative Samplescited by 628
- 2019On Variational Bounds of Mutual Informationcited by 559
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
- 2020Hard Negative Mixing for Contrastive Learningcited by 402
- 2020Understanding the Behaviour of Contrastive Losscited by 398
- 2020Debiased Contrastive Learningcited by 356
- 2014Discriminative Unsupervised Feature Learning with Exemplar Convolutional Neural Networkscited by 300
- 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 219
- 2018Learning from positive and unlabeled data: a surveycited by 219
- 2019Local Aggregation for Unsupervised Learning of Visual Embeddingscited by 204
- 2018An efficient framework for learning sentence representationscited by 198
- 2022SegCLIP: Patch Aggregation with Learnable Centers for Open-Vocabulary Semantic Segmentationcited by 164
- 2019Unsupervised Deep Learning by Neighbourhood Discoverycited by 78
- 2021ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learningcited by 72
- 2022Negative Sampling for Contrastive Representation Learning: A Reviewcited by 23
- 2020Micro-supervised Disturbance Learning: A Perspective of Representation Probability Distributioncited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.