Papers › Neural Architecture Search without Training
Neural Architecture Search without Training
Joseph Mellor, Jack Turner, Amos Storkey, Elliot J. Crowley
The time and effort involved in hand-designing deep neural networks is immense. This has prompted the development of Neural Architecture Search (NAS) techniques to automate this design. However, NAS algorithms tend to be slow and expensive; they need to train vast numbers of candidate networks to inform the search process. This could be alleviated if we could partially predict a network's trained accuracy from its initial state. In this work, we examine the overlap of activations between datapoints in untrained networks and motivate how this can give a measure which is usefully indicative of a network's trained performance. We incorporate this measure into a simple algorithm that allows us to search for powerful networks without any training in a matter of seconds on a single GPU, and verify its effectiveness on NAS-Bench-101, NAS-Bench-201, NATS-Bench, and Network Design Spaces. Our approach can be readily combined with more expensive search methods; we examine a simple adaptation of regularised evolutionary search. Code for reproducing our experiments is available at https://github.com/BayesWatch/nas-without-training.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2006.04647")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2006.04647", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2006.04647")
Code
The archive's official repository (BayesWatch/nas-without-training) was not harvested; the 9 samples below come from 2 community repositories, and 1 more is identical to code Syntology harvested from another paper's repository.
Syntology 10 code samples: 9 from 2 repositories linked to this paper, 1 identical to code harvested from another paper's repository. Across all 10: 8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 3 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: community (archive-listed): 9 samples from 2 repositories, 7 ran (5 with no instrument failure; 2 where Syntology's instrument failed); 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
10 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 3 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. 1 sample is listed last, in a group without a repository. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
866a541b53979f13 · report
fixture: signature gpu:NoneType/0/?, model:callable/0/?, mixup_gamma:float/0/float, resolution:int/0/int, batch_size:int/0/int, repeat:int/0/int, fp16:bool/0/bool · returned dict · level recorded 2026-09-22 28d3ae653452ecdf · report
fixture: signature net:callable/0/? · returned SimpleNet · level recorded 2026-09-22 693ed9995a4ce7ea · report
fixture: signature x:ndarray/1/float · returned ndarray · level recorded 2026-09-24 acf41416a7469905 · report
fixture: signature params:ndarray/1/float · returned float64 · level recorded 2026-09-24 census: 8 implementations from 11 papers, 4 distinct outputs across 2 buckets, one shared input per bucket models/mlp.py ran fingerprinted MIT (permissive) ·
0bd581e0afb4c04a · report
fixture: signature x:ndarray/2/float · returned ndarray · level recorded 2026-09-24 census: 53 implementations from 63 papers, 16 distinct outputs across 8 buckets, one shared input per bucket models/mlp.py ran fingerprinted MIT (permissive) ·
2374481500fc132c · report
fixture: signature a:ndarray/2/float · returned ndarray · level recorded 2026-09-24 248ec46cc977d5ae · report
fixture: signature optimizer:MockOptimizer/0/?, plot_learning_curve:bool/0/bool · returned tuple · level recorded 2026-09-24 1 sample is identical to code Syntology harvested from another paper's repository; this paper's own copy was not located, so no repository is named and no licence is recorded.
5aa7497aa00af169 · report
fixture: signature expected_flop:Tensor/1/float, flop_cur:float/0/float, flop_need:float/0/float, flop_tolerant:float/0/float · returned tuple · level recorded 2026-09-22 Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Neural Architecture Search | NAS-Bench-201, ImageNet-16-120 | NAS without training (N=10) | Accuracy (Test) | 38.33 | #39 of 49 | Archive leaderboard | report |
| Neural Architecture Search | NAS-Bench-201, ImageNet-16-120 | NAS without training (N=10) | Search time (s) | 1.7 | #39 of 49 | Archive leaderboard | report |
| Neural Architecture Search | NAS-Bench-201, ImageNet-16-120 | NAS without training (N=100) | Accuracy (Test) | 36.37 | #40 of 49 | Archive leaderboard | report |
| Neural Architecture Search | NAS-Bench-201, ImageNet-16-120 | NAS without training (N=100) | Search time (s) | 17.4 | #40 of 49 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections