{"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/automated-search-for-resource-efficient","title":"Automated Search for Resource-Efficient Branched Multi-Task Networks","arxiv_id":"2008.10292","date":"2020-08-24","proceeding":null,"authors":["David Bruggemann","Menelaos Kanakis","Stamatios Georgoulis","Luc van Gool"],"abstract":"The multi-modal nature of many vision problems calls for neural network architectures that can perform multiple tasks concurrently. Typically, such architectures have been handcrafted in the literature. However, given the size and complexity of the problem, this manual architecture exploration likely exceeds human design abilities. In this paper, we propose a principled approach, rooted in differentiable neural architecture search, to automatically define branching (tree-like) structures in the encoding stage of a multi-task neural network. To allow flexibility within resource-constrained environments, we introduce a proxyless, resource-aware loss that dynamically controls the model size. Evaluations across a variety of dense prediction tasks show that our approach consistently finds high-performing branching structures within limited resource budgets.","url_abs":"https://arxiv.org/abs/2008.10292v2","url_pdf":"https://arxiv.org/pdf/2008.10292v2.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":"automated-search-for-resource-efficient","repo_url":"https://github.com/brdav/bmtas","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"automated-search-for-resource-efficient","repo_url":"https://github.com/moukamisama/recon","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"architecture-search","task_name":"Neural Architecture Search"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2008.10292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10292"}},"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/brdav/bmtas","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/moukamisama/recon","reach":{"status":"ok"}}],"summary":{"unverified":7},"by_repo_kind":{"official":{"samples":7,"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":"2daf6d5b056ec557","entry":"activation_func","repo":"brdav/bmtas","repo_kind":"official","path":"src/modules.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/modules.py","link_basis":"first_harvest_node","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":"2daf6d5b056ec557"}},{"code_sha256_prefix":"3533ffb7dd8f6106","entry":"add_flops_counting_methods","repo":"brdav/bmtas","repo_kind":"official","path":"src/resources.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/resources.py","link_basis":"first_harvest_node","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":"3533ffb7dd8f6106"}},{"code_sha256_prefix":"480d00f83cefbe71","entry":"compute_gflops","repo":"brdav/bmtas","repo_kind":"official","path":"src/resources.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/resources.py","link_basis":"first_harvest_node","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":"480d00f83cefbe71"}},{"code_sha256_prefix":"71d42d596b77495e","entry":"count_parameters","repo":"brdav/bmtas","repo_kind":"official","path":"src/resources.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/resources.py","link_basis":"first_harvest_node","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":"71d42d596b77495e"}},{"code_sha256_prefix":"b1c76efc8b6f944b","entry":"normalize_array","repo":"brdav/bmtas","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","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":"b1c76efc8b6f944b"}},{"code_sha256_prefix":"a0de5b18efce4530","entry":"normalize_tensor","repo":"brdav/bmtas","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/utils.py","link_basis":"first_harvest_node","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":"a0de5b18efce4530"}},{"code_sha256_prefix":"bb3e67ec54bb65e3","entry":"read_json","repo":"brdav/bmtas","repo_kind":"official","path":"src/utils.py","file_url":"https://github.com/brdav/bmtas/blob/HEAD/src/utils.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":"bb3e67ec54bb65e3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}