{"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/cost-sensitive-self-training-for-optimizing","title":"Cost-Sensitive Self-Training for Optimizing Non-Decomposable Metrics","arxiv_id":"2304.14738","date":"2023-04-28","proceeding":null,"authors":["Harsh Rangwani","Shrinivas Ramasubramanian","Sho Takemori","Kato Takashi","Yuhei Umeda","Venkatesh Babu Radhakrishnan"],"abstract":"Self-training based semi-supervised learning algorithms have enabled the learning of highly accurate deep neural networks, using only a fraction of labeled data. However, the majority of work on self-training has focused on the objective of improving accuracy, whereas practical machine learning systems can have complex goals (e.g. maximizing the minimum of recall across classes, etc.) that are non-decomposable in nature. In this work, we introduce the Cost-Sensitive Self-Training (CSST) framework which generalizes the self-training-based methods for optimizing non-decomposable metrics. We prove that our framework can better optimize the desired non-decomposable metric utilizing unlabeled data, under similar data distribution assumptions made for the analysis of self-training. Using the proposed CSST framework, we obtain practical self-training methods (for both vision and NLP tasks) for optimizing different non-decomposable metrics using deep neural networks. Our results demonstrate that CSST achieves an improvement over the state-of-the-art in majority of the cases across datasets and objectives.","url_abs":"https://arxiv.org/abs/2304.14738v1","url_pdf":"https://arxiv.org/pdf/2304.14738v1.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":"cost-sensitive-self-training-for-optimizing","repo_url":"https://github.com/val-iisc/costsensitiveselftraining","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2304.14738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14738"}},"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/val-iisc/costsensitiveselftraining","reach":null}],"summary":{"ran":3,"ran_fixture":1,"unverified":3},"by_repo_kind":{"official":{"samples":7,"ran":4,"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":7,"samples":[{"code_sha256_prefix":"db6f345480c633d9","entry":"CSLLoss","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"db6f345480c633d9"}},{"code_sha256_prefix":"78afd5155edadae1","entry":"Get_Scalar","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"78afd5155edadae1"}},{"code_sha256_prefix":"ef03e1684bfdfe80","entry":"get_metrics","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ef03e1684bfdfe80"}},{"code_sha256_prefix":"1855fa71751d4127","entry":"net_builder","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"1855fa71751d4127"}},{"code_sha256_prefix":"890a1c88231f5bd4","entry":"FixMatch","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"890a1c88231f5bd4"}},{"code_sha256_prefix":"43d1c326e960fe77","entry":"accuracy","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"43d1c326e960fe77"}},{"code_sha256_prefix":"8698fafdeaeaacac","entry":"setattr_cls_from_kwargs","repo":"val-iisc/costsensitiveselftraining","repo_kind":"official","path":"models/fixmatch/fixmatchCSST.py","file_url":"https://github.com/val-iisc/costsensitiveselftraining/blob/HEAD/models/fixmatch/fixmatchCSST.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8698fafdeaeaacac"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}