{"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/exploiting-a-zoo-of-checkpoints-for-unseen","title":"Exploiting a Zoo of Checkpoints for Unseen Tasks","arxiv_id":"2111.03628","date":"2021-11-05","proceeding":"NeurIPS 2021 12","authors":["Jiaji Huang","Qiang Qiu","Kenneth Church"],"abstract":"There are so many models in the literature that it is difficult for practitioners to decide which combinations are likely to be effective for a new task. This paper attempts to address this question by capturing relationships among checkpoints published on the web. We model the space of tasks as a Gaussian process. The covariance can be estimated from checkpoints and unlabeled probing data. With the Gaussian process, we can identify representative checkpoints by a maximum mutual information criterion. This objective is submodular. A greedy method identifies representatives that are likely to \"cover\" the task space. These representatives generalize to new tasks with superior performance. Empirical evidence is provided for applications from both computational linguistics as well as computer vision.","url_abs":"https://arxiv.org/abs/2111.03628v1","url_pdf":"https://arxiv.org/pdf/2111.03628v1.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":"exploiting-a-zoo-of-checkpoints-for-unseen","repo_url":"https://github.com/baidu-research/task_space","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2111.03628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03628"}},"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/baidu-research/task_space","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":10},"by_repo_kind":{"official":{"samples":10,"ran":0,"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":0,"samples":[{"code_sha256_prefix":"0197e7c427b24838","entry":"KA","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/admin_computes_agent_sim.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_computes_agent_sim.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0197e7c427b24838"}},{"code_sha256_prefix":"5c288dd7d568f5ec","entry":"MI_greedy","repo":"baidu-research/task_space","repo_kind":"official","path":"MMI.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/MMI.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5c288dd7d568f5ec"}},{"code_sha256_prefix":"f72ac331772561cf","entry":"build_model","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/admin_trains_classification_head.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_trains_classification_head.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f72ac331772561cf"}},{"code_sha256_prefix":"1255577a1db4160b","entry":"compute_sim","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/admin_computes_agent_sim.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_computes_agent_sim.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1255577a1db4160b"}},{"code_sha256_prefix":"de1977f4d2b883e3","entry":"create_batch","repo":"baidu-research/task_space","repo_kind":"official","path":"LMs/data.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/LMs/data.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"de1977f4d2b883e3"}},{"code_sha256_prefix":"fa5b09e2dce09f8b","entry":"grep_result","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/analyze_result.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/analyze_result.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fa5b09e2dce09f8b"}},{"code_sha256_prefix":"e5e0fe4eb7697fcb","entry":"load_ckpt","repo":"baidu-research/task_space","repo_kind":"official","path":"LMs/ckpt.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/LMs/ckpt.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e5e0fe4eb7697fcb"}},{"code_sha256_prefix":"27559264307ca57d","entry":"read_feats","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/admin_trains_classification_head.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_trains_classification_head.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"27559264307ca57d"}},{"code_sha256_prefix":"3e615e9bd92d26c8","entry":"recast_labels","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/admin_trains_classification_head.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_trains_classification_head.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3e615e9bd92d26c8"}},{"code_sha256_prefix":"6506b7ac3eda5ef5","entry":"rotate_npy_img","repo":"baidu-research/task_space","repo_kind":"official","path":"vision/admin_extract_probe_features.py","file_url":"https://github.com/baidu-research/task_space/blob/HEAD/vision/admin_extract_probe_features.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6506b7ac3eda5ef5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}