mlsanityData to 7 Oct 2026

Tight PAC-Bayesian Risk Certificates for Contrastive Learning

arXiv 2412.03486 ↗First posted 4 Dec 2024stat.ML cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Contrastive representation learning is a modern paradigm for learning representations of unlabeled data via augmentations -- precisely, contrastive models learn to embed semantically similar pairs of samples (positive pairs) closer than independently drawn samples (negative samples). In spite of its empirical success and widespread use in foundation models, statistical theory for contrastive learning remains less explored. Recent works have developed generalization error bounds for contrastive losses, but the resulting risk certificates are either vacuous (certificates based on Rademacher complexity or f-divergence) or require strong assumptions about samples that are unreasonable in practice. The present paper develops non-vacuous PAC-Bayesian risk certificates for contrastive representation learning, considering the practical considerations of the popular SimCLR framework. Notably, we take into account that SimCLR reuses positive pairs of augmented data as negative samples for other data, thereby inducing strong dependence and making classical PAC or PAC-Bayesian bounds inapplicable. We further refine existing bounds on the downstream classification loss by incorporating SimCLR-specific factors, including data augmentation and temperature scaling, and derive risk certificates for the contrastive zero-one risk. The resulting bounds for contrastive loss and downstream prediction are much tighter than those of previous risk certificates, as demonstrated by experiments on CIFAR-10.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 40 of its 58 references that are in the map. First posted on arXiv 4 Dec 2024.

Builds on

40 of 58 references.

References · 40

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  5. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  6. 2020Exploring Simple Siamese Representation Learningcited by 2,853
  7. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  8. 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
  9. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  10. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  11. 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 982
  12. 2020Contrastive Learning of Medical Visual Representations from Paired Images and Textcited by 636
28 more
  1. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  2. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  3. 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
  4. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 374
  5. 2020Keystroke Dynamics as Part of Lifeloggingcited by 334
  6. 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 311
  7. 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 179
  8. 2020Contrastive learning, multi-view redundancy, and linear modelscited by 146
  9. 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 125
  10. 2020Tighter risk certificates for neural networkscited by 112
  11. 2022Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlapcited by 105
  12. 2021Towards the Generalization of Contrastive Self-Supervised Learningcited by 99
  13. 2023To Compress or Not to Compress- Self-Supervised Learning and Information Theory: A Reviewcited by 72
  14. 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
  15. 2021Understanding Negative Samples in Instance Discriminative Self-supervised Representation Learningcited by 47
  16. 2016Simpler PAC-Bayesian Bounds for Hostile Datacited by 45
  17. 2022Beyond Separability: Analyzing the Linear Transferability of Contrastive Representations to Related Subpopulationscited by 44
  18. 2023The SSL Interplay: Augmentations, Inductive Bias, and Generalizationcited by 40
  19. 2022A Theoretical Study of Inductive Biases in Contrastive Learningcited by 38
  20. 2023InfoNCE Loss Provably Learns Cluster-Preserving Representationscited by 37
  21. 2021Generalization Bounds for Meta-Learning via PAC-Bayes and Uniform Stabilitycited by 29
  22. 2021On the Surrogate Gap between Contrastive and Supervised Lossescited by 25
  23. 2023Generalization Analysis for Contrastive Representation Learningcited by 25
  24. 2023An Information-Theoretic Perspective on Variance-Invariance-Covariance Regularizationcited by 25
  25. 2023Contrastive Learning Is Spectral Clustering On Similarity Graphcited by 24
  26. 2021Learning PAC-Bayes Priors for Probabilistic Neural Networkscited by 21
  27. 2019PAC-Bayesian Contrastive Unsupervised Representation Learningcited by 20
  28. 2022On PAC-Bayesian reconstruction guarantees for VAEscited by 20

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 3.

6 papers.