Tight PAC-Bayesian Risk Certificates for Contrastive Learning
Anna Van Elst, Debarghya Ghoshdastidar

TL;DR
This paper develops non-vacuous PAC-Bayesian risk certificates for contrastive learning, specifically addressing the dependence issues in SimCLR and providing tighter bounds verified on CIFAR-10.
Contribution
It introduces novel PAC-Bayesian bounds tailored for contrastive learning frameworks like SimCLR, accounting for data dependence and augmentation effects.
Findings
Tighter risk certificates for contrastive loss and downstream tasks.
Effective handling of dependence induced by positive pair reuse in SimCLR.
Experimental validation on CIFAR-10 demonstrating improved bounds.
Abstract
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 -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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFault Detection and Control Systems · Machine Learning and Algorithms
Methods*Communicated@Fast*How Do I Communicate to Expedia? · Bitcoin Customer Service Number +1-833-534-1729 · Convolution · Max Pooling · Average Pooling · Global Average Pooling · Kaiming Initialization · Dense Connections · Feedforward Network · Random Resized Crop
