{"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/a-theoretical-framework-for-data-efficient","title":"A Theoretical Framework for Data Efficient Multi-Source Transfer Learning Based on Cramér-Rao Bound","arxiv_id":"2502.04242","date":"2025-02-06","proceeding":null,"authors":["Qingyue Zhang","Haohao Fu","Guanbo Huang","Yaoyuan Liang","Chang Chu","Tianren Peng","Yanru Wu","Qi Li","Yang Li","Shao-Lun Huang"],"abstract":"Multi-source transfer learning provides an effective solution to data scarcity in real-world supervised learning scenarios by leveraging multiple source tasks. In this field, existing works typically use all available samples from sources in training, which constrains their training efficiency and may lead to suboptimal results. To address this, we propose a theoretical framework that answers the question: what is the optimal quantity of source samples needed from each source task to jointly train the target model? Specifically, we introduce a generalization error measure that aligns with cross-entropy loss, and minimize it based on the Cram\\'er-Rao Bound to determine the optimal transfer quantity for each source task. Additionally, we develop an architecture-agnostic and data-efficient algorithm OTQMS to implement our theoretical results for training deep multi-source transfer learning models. Experimental studies on diverse architectures and two real-world benchmark datasets show that our proposed algorithm significantly outperforms state-of-the-art approaches in both accuracy and data efficiency. The code and supplementary materials are available in https://anonymous.4open.science/r/Materials.","url_abs":"https://arxiv.org/abs/2502.04242v1","url_pdf":"https://arxiv.org/pdf/2502.04242v1.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":[],"tasks":[{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2502.04242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04242"}},"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/zqy0126/OTQMS","reach":null}],"summary":{"ran":1,"unverified":5},"by_repo_kind":{"found_in_text":{"samples":6,"ran":1,"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":6,"samples":[{"code_sha256_prefix":"437fb4662f63588b","entry":"MLP","repo":"zqy0126/OTQMS","repo_kind":"found_in_text","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"437fb4662f63588b"}},{"code_sha256_prefix":"76290637b9490faf","entry":"Computheta","repo":"zqy0126/OTQMS","repo_kind":"found_in_text","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.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":"76290637b9490faf"}},{"code_sha256_prefix":"175c71bda4cdb132","entry":"ERM","repo":"zqy0126/OTQMS","repo_kind":"found_in_text","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.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":"175c71bda4cdb132"}},{"code_sha256_prefix":"df389b17a2896c02","entry":"Featurizer","repo":"zqy0126/OTQMS","repo_kind":"found_in_text","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.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":"df389b17a2896c02"}},{"code_sha256_prefix":"411affc7d52625a6","entry":"NormalVit","repo":"zqy0126/OTQMS","repo_kind":"found_in_text","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.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":"411affc7d52625a6"}},{"code_sha256_prefix":"a063e18ffd72f5f4","entry":"ResNet","repo":"zqy0126/OTQMS","repo_kind":"found_in_text","path":"algorithms.py","file_url":"https://github.com/zqy0126/OTQMS/blob/HEAD/algorithms.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":"a063e18ffd72f5f4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}