{"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/imprecise-label-learning-a-unified-framework","title":"Imprecise Label Learning: A Unified Framework for Learning with Various Imprecise Label Configurations","arxiv_id":"2305.12715","date":"2023-05-22","proceeding":null,"authors":["Hao Chen","Ankit Shah","Jindong Wang","Ran Tao","Yidong Wang","Xing Xie","Masashi Sugiyama","Rita Singh","Bhiksha Raj"],"abstract":"Learning with reduced labeling standards, such as noisy label, partial label, and multiple label candidates, which we generically refer to as \\textit{imprecise} labels, is a commonplace challenge in machine learning tasks. Previous methods tend to propose specific designs for every emerging imprecise label configuration, which is usually unsustainable when multiple configurations of imprecision coexist. In this paper, we introduce imprecise label learning (ILL), a framework for the unification of learning with various imprecise label configurations. ILL leverages expectation-maximization (EM) for modeling the imprecise label information, treating the precise labels as latent variables.Instead of approximating the correct labels for training, it considers the entire distribution of all possible labeling entailed by the imprecise information. We demonstrate that ILL can seamlessly adapt to partial label learning, semi-supervised learning, noisy label learning, and, more importantly, a mixture of these settings. Notably, ILL surpasses the existing specified techniques for handling imprecise labels, marking the first unified framework with robust and effective performance across various challenging settings. We hope our work will inspire further research on this topic, unleashing the full potential of ILL in wider scenarios where precise labels are expensive and complicated to obtain.","url_abs":"https://arxiv.org/abs/2305.12715v4","url_pdf":"https://arxiv.org/pdf/2305.12715v4.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":"imprecise-label-learning-a-unified-framework","repo_url":"https://github.com/hhhhhhao/general-framework-weak-supervision","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"learning-with-noisy-labels","task_name":"Learning with noisy labels"},{"task_slug":"partial-label-learning","task_name":"Partial Label Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/learning-with-noisy-labels-on-cifar-100n","task":"Learning with noisy labels","dataset":"CIFAR-100N","model":"ILL","rank_in_archive_order":7,"of":24,"metrics":{"Accuracy (mean)":"65.84"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-cifar-10n","task":"Learning with noisy labels","dataset":"CIFAR-10N-Aggregate","model":"ILL","rank_in_archive_order":5,"of":26,"metrics":{"Accuracy (mean)":"95.47"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-cifar-10n-1","task":"Learning with noisy labels","dataset":"CIFAR-10N-Random1","model":"ILL","rank_in_archive_order":5,"of":24,"metrics":{"Accuracy (mean)":"94.85"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-cifar-10n-2","task":"Learning with noisy labels","dataset":"CIFAR-10N-Random2","model":"ILL","rank_in_archive_order":3,"of":23,"metrics":{"Accuracy (mean)":"95.04"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-cifar-10n-3","task":"Learning with noisy labels","dataset":"CIFAR-10N-Random3","model":"ILL","rank_in_archive_order":3,"of":23,"metrics":{"Accuracy (mean)":"95.13"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-cifar-10n-worst","task":"Learning with noisy labels","dataset":"CIFAR-10N-Worst","model":"ILL","rank_in_archive_order":4,"of":25,"metrics":{"Accuracy (mean)":"93.58"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-clothing1m","task":"Learning with noisy labels","dataset":"Clothing1M","model":"ILL","rank_in_archive_order":4,"of":5,"metrics":{"Test Accuracy":"74.02"},"uses_additional_data":false},{"leaderboard":"/sota/learning-with-noisy-labels-on-mini-webvision","task":"Learning with noisy labels","dataset":"mini WebVision 1.0","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Top 1 Accuracy":"79.37"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-cifar-10-partial","task":"Partial Label Learning","dataset":"CIFAR-10 (partial ratio 0.1)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"96.37"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-cifar-10-partial-1","task":"Partial Label Learning","dataset":"CIFAR-10 (partial ratio 0.3)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"96.26"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-cifar-10-partial-2","task":"Partial Label Learning","dataset":"CIFAR-10 (partial ratio 0.5)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"95.91"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-cifar-100-partial","task":"Partial Label Learning","dataset":"CIFAR-100 (partial ratio 0.01)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"75.31"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-cifar-100-partial-1","task":"Partial Label Learning","dataset":"CIFAR-100 (partial ratio 0.05)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"74.58"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-cifar-100-partial-2","task":"Partial Label Learning","dataset":"CIFAR-100 (partial ratio 0.1)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"74"},"uses_additional_data":false},{"leaderboard":"/sota/partial-label-learning-on-caltech-ucsd-birds","task":"Partial Label Learning","dataset":"Caltech-UCSD Birds 200 (partial ratio 0.05)","model":"ILL","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"70.77"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.12715","atlas_url":"https://app.syntology.ai/?focus=2305.12715","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":"2305.12715"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.12715\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.12715"},"call":"get_concepts_for_paper(arxiv_id=\"2305.12715\")"}],"by_repo":[{"repo":"hhhhhhao/general-framework-weak-supervision","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2402.01922"],"harvested_for_calls":[{"arxiv_id":"2402.01922","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.01922"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.01922\")"}]}],"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":"2f80fba245213909cfe6a48a93f3ad30206796b6ff8b9de61d282394ce9b9cdb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}