Active learning from positive and unlabeled examples

• URL: http://arxiv.org/abs/2602.02081v1
• Date: Mon, 02 Feb 2026 13:28:24 GMT
• Title: Active learning from positive and unlabeled examples
• Abstract summary: Learning from positive and unlabeled data (PU learning) is a weakly supervised variant of binary classification.<n>We study an active PU learning setting where the learner can adaptively query instances from an unlabeled pool.<n>We provide the first theoretical analysis of the label complexity of active PU learning.
• Score: 6.023276947115864
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning from positive and unlabeled data (PU learning) is a weakly supervised variant of binary classification in which the learner receives labels only for (some) positively labeled instances, while all other examples remain unlabeled. Motivated by applications such as advertising and anomaly detection, we study an active PU learning setting where the learner can adaptively query instances from an unlabeled pool, but a queried label is revealed only when the instance is positive and an independent coin flip succeeds; otherwise the learner receives no information. In this paper, we provide the first theoretical analysis of the label complexity of active PU learning.

Related papers

• Learning from positive and unlabeled examples -Finite size sample bounds [5.015294654768579]
  PU learning is a variant of supervised classification learning in which the only labels revealed to the learner are of positively labeled instances.<n>This paper provides a theoretical analysis of the statistical complexity of PU learning under a wider range of setups.
  arXiv  Detail & Related papers  (2025-07-10T00:39:40Z)
• Understanding Contrastive Representation Learning from Positive Unlabeled (PU) Data [28.74519165747641]
  We study the problem of Positive Unlabeled (PU) learning, where only a small set of labeled positives and a large unlabeled pool are available.<n>We introduce Positive Unlabeled Contrastive Learning (puCL), an unbiased and variance reducing contrastive objective.<n>When the class prior is known, we propose Positive Unlabeled InfoNCE (puNCE), a prior-aware extension that re-weights unlabeled samples as soft positive negative mixtures.
  arXiv  Detail & Related papers  (2024-02-08T20:20:54Z)
• Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical [66.57396042747706]
  Complementary-label learning is a weakly supervised learning problem. We propose a consistent approach that does not rely on the uniform distribution assumption. We find that complementary-label learning can be expressed as a set of negative-unlabeled binary classification problems.
  arXiv  Detail & Related papers  (2023-11-27T02:59:17Z)
• Robust Positive-Unlabeled Learning via Noise Negative Sample Self-correction [48.929877651182885]
  Learning from positive and unlabeled data is known as positive-unlabeled (PU) learning in literature. We propose a new robust PU learning method with a training strategy motivated by the nature of human learning.
  arXiv  Detail & Related papers  (2023-08-01T04:34:52Z)
• Class-Distribution-Aware Pseudo Labeling for Semi-Supervised Multi-Label Learning [97.88458953075205]
  Pseudo-labeling has emerged as a popular and effective approach for utilizing unlabeled data. This paper proposes a novel solution called Class-Aware Pseudo-Labeling (CAP) that performs pseudo-labeling in a class-aware manner.
  arXiv  Detail & Related papers  (2023-05-04T12:52:18Z)
• Automatic Debiased Learning from Positive, Unlabeled, and Exposure Data [11.217084610985674]
  We address the issue of binary classification from positive and unlabeled data (PU classification) with a selection bias in the positive data. This scenario represents a conceptual framework for many practical applications, such as recommender systems. We propose a method to identify the function of interest using a strong ignorability assumption and develop an Automatic Debiased PUE'' (ADPUE) learning method.
  arXiv  Detail & Related papers  (2023-03-08T18:45:22Z)
• Dist-PU: Positive-Unlabeled Learning from a Label Distribution Perspective [89.5370481649529]
  We propose a label distribution perspective for PU learning in this paper. Motivated by this, we propose to pursue the label distribution consistency between predicted and ground-truth label distributions. Experiments on three benchmark datasets validate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2022-12-06T07:38:29Z)
• Positive Unlabeled Contrastive Learning [14.975173394072053]
  We extend the self-supervised pretraining paradigm to the classical positive unlabeled (PU) setting. We develop a simple methodology to pseudo-label the unlabeled samples using a new PU-specific clustering scheme. Our method handily outperforms state-of-the-art PU methods over several standard PU benchmark datasets.
  arXiv  Detail & Related papers  (2022-06-01T20:16:32Z)
• One Positive Label is Sufficient: Single-Positive Multi-Label Learning with Label Enhancement [71.9401831465908]
  We investigate single-positive multi-label learning (SPMLL) where each example is annotated with only one relevant label. A novel method named proposed, i.e., Single-positive MultI-label learning with Label Enhancement, is proposed. Experiments on benchmark datasets validate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2022-06-01T14:26:30Z)
• Learning with Proper Partial Labels [87.65718705642819]
  Partial-label learning is a kind of weakly-supervised learning with inexact labels. We show that this proper partial-label learning framework includes many previous partial-label learning settings. We then derive a unified unbiased estimator of the classification risk.
  arXiv  Detail & Related papers  (2021-12-23T01:37:03Z)
• Adaptive Positive-Unlabelled Learning via Markov Diffusion [0.0]
  Positive-Unlabelled (PU) learning is the machine learning setting in which only a set of positive instances are labelled. The principal aim of the algorithm is to identify a set of instances which are likely to contain positive instances that were originally unlabelled.
  arXiv  Detail & Related papers  (2021-08-13T10:25:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.