{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/selective-classification-via-one-sided","title":"Selective Classification via One-Sided Prediction","arxiv_id":"2010.07853","date":"2020-10-15","proceeding":null,"authors":["Aditya Gangrade","Anil Kag","Venkatesh Saligrama"],"abstract":"We propose a novel method for selective classification (SC), a problem which allows a classifier to abstain from predicting some instances, thus trading off accuracy against coverage (the fraction of instances predicted). In contrast to prior gating or confidence-set based work, our proposed method optimises a collection of class-wise decoupled one-sided empirical risks, and is in essence a method for explicitly finding the largest decision sets for each class that have few false positives. This one-sided prediction (OSP) based relaxation yields an SC scheme that attains near-optimal coverage in the practically relevant high target accuracy regime, and further admits efficient implementation, leading to a flexible and principled method for SC. We theoretically derive generalization bounds for SC and OSP, and empirically we show that our scheme strongly outperforms state of the art methods in coverage at small error levels.","url_abs":"https://arxiv.org/abs/2010.07853v4","url_pdf":"https://arxiv.org/pdf/2010.07853v4.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":"selective-classification-via-one-sided","repo_url":"https://github.com/anilkagak2/SelectiveClassification_One_Sided_Prediction","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"generalization-bounds","task_name":"Generalization Bounds"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2010.07853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07853"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/anilkagak2/SelectiveClassification_One_Sided_Prediction","reach":null}],"summary":{"ran_honours":1,"ran_draft_wrong":2},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"88a6244b528ea15a","entry":"get_mlr","repo":"anilkagak2/SelectiveClassification_One_Sided_Prediction","repo_kind":"official","path":"train_osp.py","file_url":"https://github.com/anilkagak2/SelectiveClassification_One_Sided_Prediction/blob/HEAD/train_osp.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"88a6244b528ea15a"}},{"code_sha256_prefix":"d59a585db5a39b2e","entry":"get_model_prefix","repo":"anilkagak2/SelectiveClassification_One_Sided_Prediction","repo_kind":"official","path":"train_osp.py","file_url":"https://github.com/anilkagak2/SelectiveClassification_One_Sided_Prediction/blob/HEAD/train_osp.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d59a585db5a39b2e"}},{"code_sha256_prefix":"9d67331975898e9f","entry":"m__get_prefix","repo":"anilkagak2/SelectiveClassification_One_Sided_Prediction","repo_kind":"official","path":"train_osp.py","file_url":"https://github.com/anilkagak2/SelectiveClassification_One_Sided_Prediction/blob/HEAD/train_osp.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9d67331975898e9f"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}