{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/pue-biased-positive-unlabeled-learning","title":"PUe: Biased Positive-Unlabeled Learning Enhancement by Causal Inference","arxiv_id":null,"date":"2023-09-21","proceeding":"NeurIPS 2023 11","authors":[],"abstract":"Positive-Unlabeled (PU) learning aims to achieve high-accuracy binary classification with \nlimited labeled positive examples and numerous unlabeled ones. Existing cost-sensitive-based \nmethods often rely on strong assumptions that examples with an observed positive label were \nselected entirely at random. In fact, the uneven distribution of labels is prevalent in \nreal-world PU problems, indicating that most actual positive and unlabeled data are subject \nto selection bias. In this paper, we propose a PU learning enhancement (PUe) algorithm \nbased on causal inference theory, which employs normalized propensity scores and normalized \ninverse probability weighting (NIPW) techniques to reconstruct the loss function, thus \nobtaining a consistent, unbiased estimate of the classifier and enhancing the model's \nperformance. Moreover, we investigate and propose a method for estimating propensity scores \nin deep learning using regularization techniques when the labeling mechanism is unknown. \nOur experiments on three benchmark datasets demonstrate the proposed PUe algorithm significantly \nimproves the accuracy of classifiers on non-uniform label distribution datasets compared to \nadvanced cost-sensitive PU methods. Codes are available at https://github.com/huawei-noah/Noah-research/tree/master/PUe and https://gitee.com/mindspore/models/tree/master/research/cv/PUe.","url_abs":"https://openreview.net/forum?id=6vtZIoxZoJ","url_pdf":"https://openreview.net/pdf?id=6vtZIoxZoJ","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"pue-biased-positive-unlabeled-learning","repo_url":"https://github.com/huawei-noah/noah-research","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"causal-inference","method_name":"Causal inference"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"huawei-noah/noah-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.08721"],"harvested_for_calls":[{"arxiv_id":"2204.08721","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.08721"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.08721\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ba562822595c0a3d84bbfeec3122e0e52a381fae7978b05ddb94eaaff3ad07f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}