{"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/a-unified-positive-unlabeled-learning","title":"A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labeling","arxiv_id":"2210.08709","date":"2022-10-17","proceeding":null,"authors":["Ye Wang","Xinxin Liu","Wenxin Hu","Tao Zhang"],"abstract":"Document-level relation extraction (RE) aims to identify relations between entities across multiple sentences. Most previous methods focused on document-level RE under full supervision. However, in real-world scenario, it is expensive and difficult to completely label all relations in a document because the number of entity pairs in document-level RE grows quadratically with the number of entities. To solve the common incomplete labeling problem, we propose a unified positive-unlabeled learning framework - shift and squared ranking loss positive-unlabeled (SSR-PU) learning. We use positive-unlabeled (PU) learning on document-level RE for the first time. Considering that labeled data of a dataset may lead to prior shift of unlabeled data, we introduce a PU learning under prior shift of training data. Also, using none-class score as an adaptive threshold, we propose squared ranking loss and prove its Bayesian consistency with multi-label ranking metrics. Extensive experiments demonstrate that our method achieves an improvement of about 14 F1 points relative to the previous baseline with incomplete labeling. In addition, it outperforms previous state-of-the-art results under both fully supervised and extremely unlabeled settings as well.","url_abs":"https://arxiv.org/abs/2210.08709v2","url_pdf":"https://arxiv.org/pdf/2210.08709v2.pdf","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":"a-unified-positive-unlabeled-learning","repo_url":"https://github.com/www-ye/ssr-pu","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"document-level-re-with-incomplete-labeling","task_name":"Document-level RE with incomplete labeling"},{"task_slug":"document-level-relation-extraction","task_name":"Document-level Relation Extraction"},{"task_slug":"relation-extraction","task_name":"Relation Extraction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/document-level-re-with-incomplete-labeling-on-2","task":"Document-level RE with incomplete labeling","dataset":"ChemDisGene","model":"SSR-PU","rank_in_archive_order":2,"of":3,"metrics":{"F1":"48.56"},"uses_additional_data":false},{"leaderboard":"/sota/document-level-re-with-incomplete-labeling-on-2","task":"Document-level RE with incomplete labeling","dataset":"ChemDisGene","model":"ATLOP","rank_in_archive_order":3,"of":3,"metrics":{"F1":"42.73"},"uses_additional_data":false},{"leaderboard":"/sota/document-level-re-with-incomplete-labeling-on-1","task":"Document-level RE with incomplete labeling","dataset":"Re-DocRED","model":"SSR-PU","rank_in_archive_order":1,"of":2,"metrics":{"F1":"59.50","Ign F1":"58.68"},"uses_additional_data":false},{"leaderboard":"/sota/document-level-re-with-incomplete-labeling-on-1","task":"Document-level RE with incomplete labeling","dataset":"Re-DocRED","model":"ATLOP","rank_in_archive_order":2,"of":2,"metrics":{"F1":"45.19","Ign F1":"45.09"},"uses_additional_data":false},{"leaderboard":"/sota/relation-extraction-on-redocred","task":"Relation Extraction","dataset":"ReDocRED","model":"SSR-PU","rank_in_archive_order":4,"of":8,"metrics":{"F1":"78.86","Ign F1":"77.67"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2210.08709","atlas_url":"https://app.syntology.ai/?focus=2210.08709","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2210.08709"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2210.08709\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2210.08709"},"call":"get_concepts_for_paper(arxiv_id=\"2210.08709\")"}],"by_repo":[{"repo":"www-ye/ssr-pu","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"7a25f507a853201241282d17812808bca4a082d7e116570286966982db39aaa3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}