{"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":"/method/pnas","slug":"pnas","name":"PNAS","full_name":"Progressive Neural Architecture Search","full_name_withheld":false,"description_markdown":"**Progressive Neural Architecture Search**, or **PNAS**, is a method for learning the structure of convolutional neural networks (CNNs). It uses a sequential model-based optimization (SMBO) strategy, where we search the space of cell structures, starting with simple (shallow) models and progressing to complex ones, pruning out unpromising structures as we go. \r\n\r\nAt iteration $b$ of the algorithm, we have a set of $K$ candidate cells (each of size $b$ blocks), which we train and evaluate on a dataset of interest. Since this process is expensive, PNAS also learns a model or surrogate function which can predict the performance of a structure without needing to train it. We then expand the $K$ candidates of size $b$ into $K' \\gg K$ children, each of size $b+1$. The surrogate function is used to rank all of the $K'$ children, pick the top $K$, and then train and evaluate them. We continue in this way until $b=B$, which is the maximum number of blocks we want to use in a cell.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Progressive Neural Architecture Search","paper":"/paper/progressive-neural-architecture-search","first_author":"Chenxi Liu","n_authors":10,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/progressive-neural-architecture-search"},"source":{"url":"http://arxiv.org/abs/1712.00559v3","title":"Progressive Neural Architecture Search","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Neural Architecture Search","url":"/methods/category/neural-architecture-search","pwc_aliases":[]}],"n_papers_tagged":16,"archive_num_papers":16,"papers_newest_first":[{"paper":"/paper/barrier-free-microhabitats-self-organized","slug":"barrier-free-microhabitats-self-organized","title":"Barrier-Free Microhabitats: Self-Organized Seclusion in Microbial Communities","date":"2025-03-27","arxiv_id":"2503.21621","n_code_links":1,"syntology":null},{"paper":null,"slug":"mixed-delay-nondelay-embeddings-based","title":"Mixed Delay/Nondelay Embeddings Based Neuromorphic Computing with Patterned Nanomagnet Arrays","date":"2024-12-05","arxiv_id":"2412.04622","n_code_links":0,"syntology":null},{"paper":null,"slug":"fluctuations-and-the-limit-of-predictability","title":"Fluctuations and the limit of predictability in protein evolution","date":"2024-12-02","arxiv_id":"2412.01969","n_code_links":0,"syntology":null},{"paper":null,"slug":"science-written-by-generative-ai-is-perceived","title":"From Complexity to Clarity: How AI Enhances Perceptions of Scientists and the Public's Understanding of Science","date":"2024-04-23","arxiv_id":"2405.00706","n_code_links":0,"syntology":null},{"paper":null,"slug":"cell-motility-modes-are-selected-by-the","title":"Cell motility modes are selected by the interplay of mechanosensitive adhesion and membrane tension","date":"2023-05-31","arxiv_id":"2306.00236","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-of-the-backward-deep-bsde-method","title":"Convergence of the Backward Deep BSDE Method with Applications to Optimal Stopping Problems","date":"2022-10-08","arxiv_id":"2210.04118","n_code_links":0,"syntology":null},{"paper":null,"slug":"popnasv2-an-efficient-multi-objective-neural","title":"POPNASv2: An Efficient Multi-Objective Neural Architecture Search Technique","date":"2022-10-06","arxiv_id":"2210.02959","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-stochastic-gradient-descent-and","title":"Stochastic Gradient Descent and Anomaly of Variance-flatness Relation in Artificial Neural Networks","date":"2022-07-11","arxiv_id":"2207.04932","n_code_links":0,"syntology":null},{"paper":null,"slug":"information-cocoons-in-online-navigation","title":"Information Cocoons in Online Navigation","date":"2021-09-14","arxiv_id":"2109.06589","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-interaction-kernels-for-agent","title":"Learning Interaction Kernels for Agent Systems on Riemannian Manifolds","date":"2021-01-30","arxiv_id":"2102.00327","n_code_links":0,"syntology":null},{"paper":null,"slug":"stabilizing-deep-tomographic-reconstruction","title":"Stabilizing Deep Tomographic Reconstruction","date":"2020-08-04","arxiv_id":"2008.01846","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-transcriptomic-signature-and-general","title":"On the Transcriptomic Signature and General Stress State Associated with Aneuploidy","date":"2020-07-28","arxiv_id":"2007.14585","n_code_links":0,"syntology":null},{"paper":"/paper/weak-sindy-for-partial-differential-equations","slug":"weak-sindy-for-partial-differential-equations","title":"Weak SINDy For Partial Differential Equations","date":"2020-07-06","arxiv_id":"2007.02848","n_code_links":2,"syntology":null},{"paper":null,"slug":"sparse-identification-of-nonlinear-dynamical","title":"Sparse Identification of Nonlinear Dynamical Systems via Reweighted $\\ell_1$-regularized Least Squares","date":"2020-05-27","arxiv_id":"2005.13232","n_code_links":0,"syntology":null},{"paper":"/paper/auto-keras-efficient-neural-architecture","slug":"auto-keras-efficient-neural-architecture","title":"Auto-Keras: An Efficient Neural Architecture Search System","date":"2018-06-27","arxiv_id":"1806.10282","n_code_links":13,"syntology":{"ran":6,"of":6,"n_ran_checked":4,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/progressive-neural-architecture-search","slug":"progressive-neural-architecture-search","title":"Progressive Neural Architecture Search","date":"2017-12-02","arxiv_id":"1712.00559","n_code_links":18,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["chenxi116/PNASNet.TF","tensorflow/models","chenxi116/PNASNet.pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}],"papers_shown":16,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":16,"with_a_code_link":4,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/pnas/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/pnas/papers/ran/1","json":"/method/pnas/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":3},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":1},{"task":"/task/articles","name":"Articles","papers":1},{"task":"/task/automl","name":"AutoML","papers":1},{"task":"/task/bayesian-optimization","name":"Bayesian Optimization","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/computed-tomography-ct","name":"Computed Tomography (CT)","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/evolutionary-algorithms","name":"Evolutionary Algorithms","papers":1},{"task":"/task/friction","name":"Friction","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/large-language-model","name":"Large Language Model","papers":1},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":null,"name":"Relation","papers":1}],"tasks_shown":20,"n_tasks":24,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":1},{"year":"2020","papers":4},{"year":"2021","papers":2},{"year":"2022","papers":3},{"year":"2023","papers":1},{"year":"2024","papers":3},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/pnas"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=PNAS","read_at":"2026-10-05T01:00:24+00:00","query":"PNAS","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1712.00559","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'PNAS' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"dff39d6763b3072e5b5e0541a273d7f34e3143548d75825479b55b17b21374e8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}