Noisy-Pair Robust Representation Alignment for Positive-Unlabeled Learning
Not on the map. Why?
Abstract (arXiv)
Positive-Unlabeled (PU) learning aims to train a binary classifier (positive vs. negative) where only limited positive data and abundant unlabeled data are available. While widely applicable, state-of-the-art PU learning methods substantially underperform their supervised counterparts on complex datasets, especially without auxiliary negatives or pre-estimated parameters (e.g., a 14.26% gap on CIFAR-100 dataset). We identify the primary bottleneck as the challenge of learning discriminative representations under unreliable supervision. To tackle this challenge, we propose NcPU, a non-contrastive PU learning framework that requires no auxiliary information. NcPU combines a noisy-pair robust supervised non-contrastive loss (NoiSNCL), which aligns intra-class representations despite unreliable supervision, with a phantom label disambiguation (PLD) scheme that supplies conservative negative supervision via regret-based label updates. Theoretically, NoiSNCL and PLD can iteratively benefit each other from the perspective of the Expectation-Maximization framework. Empirically, extensive experiments demonstrate that: (1) NoiSNCL enables simple PU methods to achieve competitive performance; and (2) NcPU achieves substantial improvements over state-of-the-art PU methods across diverse datasets, including challenging datasets on post-disaster building damage mapping, highlighting its promise for real-world applications. Code: Code will be open-sourced after review.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 43 references that are in the map. First posted on arXiv 30 Sep 2025.
Builds on
24 of 43 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2020Exploring Simple Siamese Representation Learningcited by 2,853
- 2020Supervised Contrastive Learningcited by 2,803
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
- 2022FreeMatch: Self-adaptive Thresholding for Semi-supervised Learningcited by 232
- 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
- 2022Selective-Supervised Contrastive Learning with Noisy Labelscited by 112
- 2021Towards the Generalization of Contrastive Self-Supervised Learningcited by 99
- 2016Mixture Proportion Estimation via Kernel Embedding of Distributionscited by 67
- 2021Mixture Proportion Estimation and PU Learning: A Modern Approachcited by 52
12 more
- 2014PU Learning for Matrix Completioncited by 30
- 2023Twin Contrastive Learning with Noisy Labelscited by 28
- 2022PiCO+: Contrastive Label Disambiguation for Robust Partial Label Learningcited by 21
- 2024f-MICL: Understanding and Generalizing InfoNCE-based Contrastive Learningcited by 13
- 2023Beyond Myopia: Learning from Positive and Unlabeled Data through Holistic Predictive Trendscited by 9
- 2022Positive-Unlabeled Learning using Random Forests via Recursive Greedy Risk Minimizationcited by 8
- 2023Class Prior-Free Positive-Unlabeled Learning with Taylor Variational Loss for Hyperspectral Remote Sensing Imagerycited by 8
- 2022One-Class Risk Estimation for One-Class Hyperspectral Image Classificationcited by 6
- 2025Representation Learning via Non-Contrastive Mutual Informationcited by 5
- 2025Semantic Concentration for Self-Supervised Dense Representations Learningcited by 3
- 2021Building Damage Mapping with Self-PositiveUnlabeled Learningcited by 2
- 2025Weakly-Supervised Contrastive Learning for Imprecise Class Labelscited by 1
Built on by
Not cited yet.