Papers › DEDPUL: Difference-of-Estimated-Densities-based Positive-Unlabeled Learning

DEDPUL: Difference-of-Estimated-Densities-based Positive-Unlabeled Learning

19 Feb 2019arXiv:1902.06965archive 2025-07-28

Dmitry Ivanov

Positive-Unlabeled (PU) learning is an analog to supervised binary classification for the case when only the positive sample is clean, while the negative sample is contaminated with latent instances of positive class and hence can be considered as an unlabeled mixture. The objectives are to classify the unlabeled sample and train an unbiased PN classifier, which generally requires to identify the mixing proportions of positives and negatives first. Recently, unbiased risk estimation framework has achieved state-of-the-art performance in PU learning. This approach, however, exhibits two major bottlenecks. First, the mixing proportions are assumed to be identified, i.e. known in the domain or estimated with additional methods. Second, the approach relies on the classifier being a neural network. In this paper, we propose DEDPUL, a method that solves PU Learning without the aforementioned issues. The mechanism behind DEDPUL is to apply a computationally cheap post-processing procedure to the predictions of any classifier trained to distinguish positive and unlabeled data. Instead of assuming the proportions to be identified, DEDPUL estimates them alongside with classifying unlabeled sample. Experiments show that DEDPUL outperforms the current state-of-the-art in both proportion estimation and PU Classification.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1902.06965")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

dimonenka/DEDPUL officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from dimonenka/DEDPUL. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

all_convolution dimonenka/DEDPUL/NN_functions.py official repository unverified MIT (permissive) · 2fc1e462fa17bf92 · report
compute_best_rbf_kernel_width dimonenka/DEDPUL/KMPE.py official repository unverified MIT (permissive) · c7b90aa51789cfcf · report
compute_log_likelihood dimonenka/DEDPUL/utils.py official repository unverified MIT (permissive) · de4c8b239a02d418 · report
d_loss_standard dimonenka/DEDPUL/NN_functions.py official repository unverified MIT (permissive) · 3362ee82dfdbe3e8 · report
estimate_preds_cv_sklearn dimonenka/DEDPUL/algorithms.py official repository unverified MIT (permissive) · e89d726f7cb1bfcd · report
get_discriminator dimonenka/DEDPUL/NN_functions.py official repository unverified MIT (permissive) · fdf1ad5d8442958e · report
loguniform dimonenka/DEDPUL/utils.py official repository unverified MIT (permissive) · 7116aa940a83577a · report
low_c dimonenka/DEDPUL/TIcE.py official repository unverified MIT (permissive) · 1ff62228d9b009fc · report
max_bepp dimonenka/DEDPUL/TIcE.py official repository unverified MIT (permissive) · 8539d764f42cb41e · report
pick_delta dimonenka/DEDPUL/TIcE.py official repository unverified MIT (permissive) · 50b21e7e6829bc67 · report
rolling_apply dimonenka/DEDPUL/utils.py official repository unverified MIT (permissive) · a57fe4dd902f2b9a · report

Tasks

Binary ClassificationDensity EstimationGeneral Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections