mlsanityData to 7 Oct 2026

Soft Label PU Learning

arXiv 2405.01990 ↗First posted 3 May 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

PU learning refers to the classification problem in which only part of positive samples are labeled. Existing PU learning methods treat unlabeled samples equally. However, in many real tasks, from common sense or domain knowledge, some unlabeled samples are more likely to be positive than others. In this paper, we propose soft label PU learning, in which unlabeled data are assigned soft labels according to their probabilities of being positive. Considering that the ground truth of TPR, FPR, and AUC are unknown, we then design PU counterparts of these metrics to evaluate the performances of soft label PU learning methods within validation data. We show that these new designed PU metrics are good substitutes for the real metrics. After that, a method that optimizes such metrics is proposed. Experiments on public datasets and real datasets for anti-cheat services from Tencent games demonstrate the effectiveness of our proposed method.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 30 references that are in the map. First posted on arXiv 3 May 2024.

Builds on

10 of 30 references.

References · 10

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2018Learning from positive and unlabeled data: a surveycited by 218
  3. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
  4. 2017Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labelscited by 52
  5. 2020Self-PU: Self Boosted and Calibrated Positive-Unlabeled Trainingcited by 47
  6. 2016Class-prior Estimation for Learning from Positive and Unlabeled Datacited by 46
  7. 2018Beyond the Selected Completely At Random Assumption for Learning from Positive and Unlabeled Datacited by 36
  8. 2018Instance-Dependent PU Learning by Bayesian Optimal Relabelingcited by 18
  9. 2019On the rate of convergence of fully connected very deep neural network regression estimatescited by 14
  10. 2019Minimax Rate Optimal Adaptive Nearest Neighbor Classification and Regressioncited by 11

Built on by

Not cited yet.