PULNS: Positive-Unlabeled Learning with Effective Negative Sample Selector
Chuan Luo, Pu Zhao, Chen Chen, Bo Qiao, Chao Du, Hongyu Zhang, Wei Wu, Shaowei Cai, Bing He, Saravanakumar Rajmohan, Qingwei Lin
Abstract
Positive-unlabeled learning (PU learning) is an important case of binary classification where the training data only contains positive and unlabeled samples. The current state-of-the-art approach for PU learning is the cost-sensitive approach, which casts PU learning as a cost-sensitive classification problem and relies on unbiased risk estimator for correcting the bias introduced by the unlabeled samples. However, this approach requires the knowledge of class prior and is subject to the potential label noise. In this paper, we propose a novel PU learning approach dubbed PULNS, equipped with an effective negative sample selector, which is optimized by reinforcement learning. Our PULNS approach employs an effective negative sample selector as the agent responsible for selecting negative samples from the unlabeled data. While the selected, likely negative samples can be used to improve the classifier, the performance of classifier is also used as the reward to improve the selector through the REINFORCE algorithm. By alternating the updates of the selector and the classifier, the performance of both is improved. Extensive experimental studies on 7 real-world application benchmarks demonstrate that PULNS consistently outperforms the current state-of-the-art methods in PU learning, and our experimental results also confirm the effectiveness of the negative sample selector underlying PULNS.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c03b60e9-159c-4e2f-98c6-c0c0fb415e6bCited by top-tier papers21
- GraphSR: A Data Augmentation Algorithm for Imbalanced Node ClassificationMengting Zhou, Zhiguo GongAAAI 2023 · 48 citations
- Dist-PU: Positive-Unlabeled Learning from a Label Distribution PerspectiveYunrui Zhao, Qianqian Xu, Yangbangyan Jiang, Peisong Wen et al.CVPR 2022 · 47 citations
- NTAM: Neighborhood-Temporal Attention Model for Disk Failure Prediction in Cloud PlatformsChuan Luo, Pu Zhao, Bo Qiao, Youjiang Wu et al.WWW 2021 · 37 citations
- Beyond Myopia: Learning from Positive and Unlabeled Data through Holistic Predictive TrendsXinrui Wang, Wenhai Wan, Chuanxing Geng, Shaoyuan Li et al.NeurIPS 2023 · 24 citations
- Targeted Representation Alignment for Open-World Semi-Supervised LearningRuixuan Xiao, Lei Feng, Kai Tang, Junbo Zhao et al.CVPR 2024 · 12 citations
Builds on3
- Fast Nonparametric Estimation of Class Proportions in the Positive-Unlabeled Classification SettingDaniel Zeiberg, Shantanu Jain, Predrag RadivojacAAAI 2020 · 23 citations
- Class Prior Estimation with Biased Positives and Unlabeled ExamplesShantanu Jain, Justin Delano, Himanshu Sharma, Predrag RadivojacAAAI 2020 · 15 citations
- Learning from Positive and Unlabeled Data without Explicit Estimation of Class PriorChenguang Zhang, Yuexian Hou, Yan ZhangAAAI 2020 · 7 citations
Related papers
- Balancing Positive and Negative Classification Error Rates in Positive-Unlabeled LearningXiming Li, Yuanchao Dai, Bing Wang, Changchun Li et al.NeurIPS 2025 · 3 citations
- Improving Neural Relation Extraction with Positive and Unlabeled LearningZhengqiu He, Wenliang Chen, Yuyi Wang, Wei Zhang et al.AAAI 2020 · 18 citations
- Accessible, Realistic, and Fair Evaluation of Positive-Unlabeled Learning AlgorithmsWei Wang, Dong-Dong Wu, Ming Li, Jingxiong Zhang et al.ICLR 2026 · 2 citations
- Learning from Positive and Unlabeled Data with Arbitrary Positive ShiftZayd Hammoudeh, Daniel LowdNeurIPS 2020 · 53 citations
- Recovering the Propensity Score from Biased Positive Unlabeled DataWalter Gerych, Thomas Hartvigsen, Luke Buquicchio, Emmanuel Agu et al.AAAI 2022 · 20 citations
