{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/greedynas-towards-fast-one-shot-nas-with","title":"GreedyNAS: Towards Fast One-Shot NAS with Greedy Supernet","arxiv_id":"2003.11236","date":"2020-03-25","proceeding":"CVPR 2020 6","authors":["Shan You","Tao Huang","Mingmin Yang","Fei Wang","Chen Qian","Chang-Shui Zhang"],"abstract":"Training a supernet matters for one-shot neural architecture search (NAS) methods since it serves as a basic performance estimator for different architectures (paths). Current methods mainly hold the assumption that a supernet should give a reasonable ranking over all paths. They thus treat all paths equally, and spare much effort to train paths. However, it is harsh for a single supernet to evaluate accurately on such a huge-scale search space (e.g., $7^{21}$). In this paper, instead of covering all paths, we ease the burden of supernet by encouraging it to focus more on evaluation of those potentially-good ones, which are identified using a surrogate portion of validation data. Concretely, during training, we propose a multi-path sampling strategy with rejection, and greedily filter the weak paths. The training efficiency is thus boosted since the training space has been greedily shrunk from all paths to those potentially-good ones. Moreover, we further adopt an exploration and exploitation policy by introducing an empirical candidate path pool. Our proposed method GreedyNAS is easy-to-follow, and experimental results on ImageNet dataset indicate that it can achieve better Top-1 accuracy under same search space and FLOPs or latency level, but with only $\\sim$60\\% of supernet training cost. By searching on a larger space, our GreedyNAS can also obtain new state-of-the-art architectures.","url_abs":"https://arxiv.org/abs/2003.11236v1","url_pdf":"https://arxiv.org/pdf/2003.11236v1.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":"all","task_name":"All"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"architecture-search","task_name":"Neural Architecture Search"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"cosine-annealing","method_name":"Cosine Annealing"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"depthwise-convolution","method_name":"Depthwise Convolution"},{"method_slug":"depthwise-separable-convolution","method_name":"Depthwise Separable Convolution"},{"method_slug":"greedynas","method_name":"GreedyNAS"},{"method_slug":"greedynas-a","method_name":"GreedyNAS-A"},{"method_slug":"greedynas-b","method_name":"GreedyNAS-B"},{"method_slug":"greedynas-c","method_name":"GreedyNAS-C"},{"method_slug":"inverted-residual-block","method_name":"Inverted Residual Block"},{"method_slug":"linear-warmup-with-linear-decay","method_name":"Linear Warmup With Linear Decay"},{"method_slug":"nesterov-accelerated-gradient","method_name":"Nesterov Accelerated Gradient"},{"method_slug":"pointwise-convolution","method_name":"Pointwise Convolution"},{"method_slug":"rmsprop","method_name":"RMSProp"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"squeeze-and-excitation-block","method_name":"Squeeze-and-Excitation Block"}],"datasets_introduced":[],"methods_introduced":[{"slug":"greedynas","name":"GreedyNAS","full_name":"GreedyNAS"},{"slug":"greedynas-b","name":"GreedyNAS-B","full_name":"GreedyNAS-B"},{"slug":"greedynas-c","name":"GreedyNAS-C","full_name":"GreedyNAS-C"}],"results":[{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"GreedyNAS-A","rank_in_archive_order":887,"of":1060,"metrics":{"GFLOPs":"0.366","Number of params":"6.5M","Top 1 Accuracy":"77.1%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"GreedyNAS-B","rank_in_archive_order":898,"of":1060,"metrics":{"GFLOPs":"0.324","Number of params":"5.2M","Top 1 Accuracy":"76.8%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"GreedyNAS-C","rank_in_archive_order":922,"of":1060,"metrics":{"GFLOPs":"0.284","Number of params":"4.7M","Top 1 Accuracy":"76.2%"},"uses_additional_data":false},{"leaderboard":"/sota/neural-architecture-search-on-imagenet","task":"Neural Architecture Search","dataset":"ImageNet","model":"GreedyNAS-A","rank_in_archive_order":72,"of":135,"metrics":{"Accuracy":"77.1","Params":"6.5M","Top-1 Error Rate":"22.9"},"uses_additional_data":false},{"leaderboard":"/sota/neural-architecture-search-on-imagenet","task":"Neural Architecture Search","dataset":"ImageNet","model":"GreedyNAS-B","rank_in_archive_order":79,"of":135,"metrics":{"Accuracy":"76.8","Params":"5.2M","Top-1 Error Rate":"23.2"},"uses_additional_data":false},{"leaderboard":"/sota/neural-architecture-search-on-imagenet","task":"Neural Architecture Search","dataset":"ImageNet","model":"GreedyNAS-C","rank_in_archive_order":89,"of":135,"metrics":{"Accuracy":"76.2","Params":"4.7M","Top-1 Error Rate":"23.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2003.11236","atlas_url":"https://app.syntology.ai/?focus=2003.11236","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2003.11236"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2003.11236\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2003.11236"},"call":"get_concepts_for_paper(arxiv_id=\"2003.11236\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fa9b1796837e5fdf41ebe96f3d86c107e9470b262ba31791edcaec877cc2f114","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}