{"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/transferable-and-principled-efficiency-for","title":"Transferable and Principled Efficiency for Open-Vocabulary Segmentation","arxiv_id":"2404.07448","date":"2024-04-11","proceeding":"CVPR 2024 1","authors":["Jingxuan Xu","Wuyang Chen","Yao Zhao","Yunchao Wei"],"abstract":"Recent success of pre-trained foundation vision-language models makes Open-Vocabulary Segmentation (OVS) possible. Despite the promising performance, this approach introduces heavy computational overheads for two challenges: 1) large model sizes of the backbone; 2) expensive costs during the fine-tuning. These challenges hinder this OVS strategy from being widely applicable and affordable in real-world scenarios. Although traditional methods such as model compression and efficient fine-tuning can address these challenges, they often rely on heuristics. This means that their solutions cannot be easily transferred and necessitate re-training on different models, which comes at a cost. In the context of efficient OVS, we target achieving performance that is comparable to or even better than prior OVS works based on large vision-language foundation models, by utilizing smaller models that incur lower training costs. The core strategy is to make our efficiency principled and thus seamlessly transferable from one OVS framework to others without further customization. Comprehensive experiments on diverse OVS benchmarks demonstrate our superior trade-off between segmentation accuracy and computation costs over previous works. Our code is available on https://github.com/Xujxyang/OpenTrans","url_abs":"https://arxiv.org/abs/2404.07448v3","url_pdf":"https://arxiv.org/pdf/2404.07448v3.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":"transferable-and-principled-efficiency-for","repo_url":"https://github.com/xujxyang/opentrans","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"model-compression","task_name":"Model Compression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2404.07448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07448"}},"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":"deterministic:regex_extraction","url":"https://github.com/Xujxyang/OpenTrans","reach":{"status":"ok","spdx":"NOASSERTION"}}],"summary":{"ran_honours":3,"ran":1},"by_repo_kind":{"official":{"samples":4,"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":4,"samples":[{"code_sha256_prefix":"5c273c526536356d","entry":"centering","repo":"Xujxyang/OpenTrans","repo_kind":"official","path":"CKA.py","file_url":"https://github.com/Xujxyang/OpenTrans/blob/HEAD/CKA.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5c273c526536356d"}},{"code_sha256_prefix":"c633017bfba675e4","entry":"kernel_HSIC","repo":"Xujxyang/OpenTrans","repo_kind":"official","path":"CKA.py","file_url":"https://github.com/Xujxyang/OpenTrans/blob/HEAD/CKA.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c633017bfba675e4"}},{"code_sha256_prefix":"35fe0192a58f9bea","entry":"median","repo":"Xujxyang/OpenTrans","repo_kind":"official","path":"plain_train_net.py","file_url":"https://github.com/Xujxyang/OpenTrans/blob/HEAD/plain_train_net.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"35fe0192a58f9bea"}},{"code_sha256_prefix":"0f137cab706f1953","entry":"rbf","repo":"Xujxyang/OpenTrans","repo_kind":"official","path":"CKA.py","file_url":"https://github.com/Xujxyang/OpenTrans/blob/HEAD/CKA.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"0f137cab706f1953"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}