Jul 2026· IEEE Transactions on Neural Networks and Learning Systems· Vol PP· 0 citations
Medicine
TL;DR
A novel supervision formulation from a risk perspective is derived: if the class prior is known, the ratio between the positive risk distribution of negative samples and the negative risk distribution of positive samples converges to a fixed value in unlabeled samples.
Abstract
As one of the classical strategies for positive-unlabeled (PU) learning, the cost-sensitive methods achieve binary classification by minimizing the overall risk. To achieve this goal, the class prior is usually exploited to guide model learning in many state-of-the-art cost-sensitive approaches. However, how to effectively mine the underlying supervision information using the class prior remains a major challenging problem. It is known that the distribution of positive and negative samples is fixed in unlabeled samples when the class prior is available. Based on this knowledge, we derive a novel supervision formulation from a risk perspective: if the class prior is known, the ratio between the positive risk distribution of negative samples and the negative risk distribution of positive samples converges to a fixed value in unlabeled samples. By fully exploiting this brand-new constraint, we construct a consistent risk estimator to impose consistency between the negative expected risk of the positive samples and the positive expected risk of the negative samples. Moreover, we introduce Mixup regularization to mitigate the confirmation bias of the learned model, and meanwhile employ the entropy minimization technique to improve the separability of samples, which can further enhance classification performance. Experimental results on four benchmark datasets demonstrate the advantage of our model over several baseline methods. The code is available at https://github.com/yunbao520/cPU.
SMVPU first extracts reliable negative samples from the unlabeled set and assigns similarity-weighted values to the remaining unlabeled instances, and then incorporates multi-view representations to enhance feature compatibility and discriminability.
Bo Liu, Wentao Li, Fan Cao et al.· Applied intelligence (Boston...· 0 citations
C-Score, a compact framework that evaluates training behavior in three complementary spaces: prediction, feature representation, and optimization, suggests that clean accuracy alone is insufficient for evaluating SSL robustness in open-world environments, and that internal diagnostic signals are necessary for more reliable robustness assessment under unlabeled contamination.
Tsao-Lun Chen, Chicheng Fu, Han-Yi Chou et al.· 0 citations
DPCL was leveraged to learn better representation distributions by uniformly projecting data on a hypersphere, and by which more accurate pseudo labels could be generated, and achieves consistent improvements over existing state-of-the-art methods across multiple benchmarks.
Pengfei Lv, Jing Chai· International Conference on...· 0 citations
Gaussian-mixture calculations and a medical diagnosis example illustrate how uncertainty-dependent labeling mechanisms can improve estimation and classification under a fixed labeling budget.
You‐Gan Wang, Jinran Wu, Geoffrey J. McLachlan· 0 citations
Evaluating the performance of Greedy K-center across a variety of metric spaces shows that mapping unlabeled instances into a predictive probability space and weighting the result by entropy often dominates the other options for active learning selection with Greedy K-center.
A comprehensive study to investigate the basic characteristics of current Positive-Unlabeled learning methods and proposes a general framework of PU learning by integrating the set-aware empirical risk with pseudo-labeling.
Yuanchao Dai, Zhengzhang Hou, C. Li et al.· Neural Information Processin...· 2 citations