{"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/aows-adaptive-and-optimal-network-width","title":"AOWS: Adaptive and optimal network width search with latency constraints","arxiv_id":"2005.10481","date":"2020-05-21","proceeding":"CVPR 2020 6","authors":["Maxim Berman","Leonid Pishchulin","Ning Xu","Matthew B. Blaschko","Gerard Medioni"],"abstract":"Neural architecture search (NAS) approaches aim at automatically finding novel CNN architectures that fit computational constraints while maintaining a good performance on the target platform. We introduce a novel efficient one-shot NAS approach to optimally search for channel numbers, given latency constraints on a specific hardware. We first show that we can use a black-box approach to estimate a realistic latency model for a specific inference platform, without the need for low-level access to the inference computation. Then, we design a pairwise MRF to score any channel configuration and use dynamic programming to efficiently decode the best performing configuration, yielding an optimal solution for the network width search. Finally, we propose an adaptive channel configuration sampling scheme to gradually specialize the training phase to the target computational constraints. Experiments on ImageNet classification show that our approach can find networks fitting the resource constraints on different target platforms while improving accuracy over the state-of-the-art efficient networks.","url_abs":"https://arxiv.org/abs/2005.10481v1","url_pdf":"https://arxiv.org/pdf/2005.10481v1.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":"aows-adaptive-and-optimal-network-width","repo_url":"https://github.com/bermanmaxim/AOWS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"architecture-search","task_name":"Neural Architecture Search"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2005.10481","atlas_url":"https://app.syntology.ai/?focus=2005.10481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10481"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/bermanmaxim/AOWS","reach":{"status":"ok","spdx":"MIT"}}],"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":"05edb495f972da82","entry":"accuracy","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"misc.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/misc.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":"05edb495f972da82"}},{"code_sha256_prefix":"580670be3c585327","entry":"aows_temp","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"train_nas.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/train_nas.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":"580670be3c585327"}},{"code_sha256_prefix":"eefdfc0fa86b3dd0","entry":"complete","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"viterbi.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/viterbi.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":"eefdfc0fa86b3dd0"}},{"code_sha256_prefix":"ee2f4aa1e69125ab","entry":"maxsum","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"viterbi.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/viterbi.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":"ee2f4aa1e69125ab"}},{"code_sha256_prefix":"dfc753382f18458e","entry":"score","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"viterbi.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/viterbi.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":"dfc753382f18458e"}},{"code_sha256_prefix":"49afece34f1fc351","entry":"soft_cross_entropy","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"misc.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/misc.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":"49afece34f1fc351"}},{"code_sha256_prefix":"e5242ed4761b8e1b","entry":"tuplify","repo":"bermanmaxim/AOWS","repo_kind":"official","path":"misc.py","file_url":"https://github.com/bermanmaxim/AOWS/blob/HEAD/misc.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":"e5242ed4761b8e1b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}