Weakly-Supervised Contrastive Learning for Imprecise Class Labels
Zi-Hao Zhou, Jun-Jie Wang, Tong Wei, Min-Ling Zhang

TL;DR
This paper introduces a weakly-supervised contrastive learning framework that uses semantic similarity instead of unreliable class labels, improving representation learning in noisy or partial label scenarios.
Contribution
It proposes a novel graph-theoretic approach leveraging semantic similarity for contrastive learning with imprecise labels, supported by theoretical error bounds.
Findings
Effective in noisy label scenarios
Improves performance over existing methods
Theoretically approximates supervised contrastive learning
Abstract
Contrastive learning has achieved remarkable success in learning effective representations, with supervised contrastive learning often outperforming self-supervised approaches. However, in real-world scenarios, data annotations are often ambiguous or inaccurate, meaning that class labels may not reliably indicate whether two examples belong to the same class. This limitation restricts the applicability of supervised contrastive learning. To address this challenge, we introduce the concept of ``continuous semantic similarity'' to define positive and negative pairs. Instead of directly relying on imprecise class labels, we measure the semantic similarity between example pairs, which quantifies how closely they belong to the same category by iteratively refining weak supervisory signals. Based on this concept, we propose a graph-theoretic framework for weakly-supervised contrastive…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Face and Expression Recognition · Advanced Graph Neural Networks
