mlsanityData to 7 Oct 2026

Beyond Myopia: Learning from Positive and Unlabeled Data through Holistic Predictive Trends

arXiv 2310.04078 ↗First posted 6 Oct 2023cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Learning binary classifiers from positive and unlabeled data (PUL) is vital in many real-world applications, especially when verifying negative examples is difficult. Despite the impressive empirical performance of recent PUL methods, challenges like accumulated errors and increased estimation bias persist due to the absence of negative labels. In this paper, we unveil an intriguing yet long-overlooked observation in PUL: textitresampling the positive data in each training iteration to ensure a balanced distribution between positive and unlabeled examples results in strong early-stage performance. Furthermore, predictive trends for positive and negative classes display distinctly different patterns. Specifically, the scores (output probability) of unlabeled negative examples consistently decrease, while those of unlabeled positive examples show largely chaotic trends. Instead of focusing on classification within individual time frames, we innovatively adopt a holistic approach, interpreting the scores of each example as a temporal point process (TPP). This reformulates the core problem of PUL as recognizing trends in these scores. We then propose a novel TPP-inspired measure for trend detection and prove its asymptotic unbiasedness in predicting changes. Notably, our method accomplishes PUL without requiring additional parameter tuning or prior assumptions, offering an alternative perspective for tackling this problem. Extensive experiments verify the superiority of our method, particularly in a highly imbalanced real-world setting, where it achieves improvements of up to 11.3% in key metrics. The code is available at hrefhttps://github.com/wxr99/HolisticPUhttps://github.com/wxr99/HolisticPU.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 26 of its 64 references that are in the map. First posted on arXiv 6 Oct 2023.

Builds on

26 of 64 references.

References · 26

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  2. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  4. 2017A Closer Look at Memorization in Deep Networkscited by 936
  5. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 691
  6. 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 537
  7. 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
  8. 2018Learning from positive and unlabeled data: a surveycited by 218
  9. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
  10. 2021Sample Selection with Uncertainty of Losses for Learning with Noisy Labelscited by 79
  11. 2016Mixture Proportion Estimation via Kernel Embedding of Distributionscited by 67
  12. 2017Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labelscited by 52
14 more
  1. 2021Mixture Proportion Estimation and PU Learning: A Modern Approachcited by 52
  2. 2020Self-PU: Self Boosted and Calibrated Positive-Unlabeled Trainingcited by 47
  3. 2016Class-prior Estimation for Learning from Positive and Unlabeled Datacited by 46
  4. 2017Early Stopping without a Validation Setcited by 39
  5. 2022Dist-PU: Positive-Unlabeled Learning from a Label Distribution Perspectivecited by 37
  6. 2018Classification from Positive, Unlabeled and Biased Negative Datacited by 34
  7. 2014PU Learning for Matrix Completioncited by 30
  8. 2020Learning from Positive and Unlabeled Data with Arbitrary Positive Shiftcited by 23
  9. 2018Instance-Dependent PU Learning by Bayesian Optimal Relabelingcited by 18
  10. 2020On Positive-Unlabeled Classification in GANcited by 14
  11. 2022Positive-Unlabeled Learning using Random Forests via Recursive Greedy Risk Minimizationcited by 8
  12. 2020MixPUL: Consistency-based Augmentation for Positive and Unlabeled Learningcited by 5
  13. 2020Leave Zero Out: Towards a No-Cross-Validation Approach for Model Selectioncited by 5
  14. 2021A Novel Perspective for Positive-Unlabeled Learning via Noisy Labelscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 2; 2026: 2.

9 papers.