Papers › Self-supervised Representation Learning for Evolutionary Neural Architecture Search

Self-supervised Representation Learning for Evolutionary Neural Architecture Search

31 Oct 2020arXiv:2011.00186archive 2025-07-28

Chen Wei, Yiping Tang, Chuang Niu, Haihong Hu, Yue Wang, Jimin Liang

Recently proposed neural architecture search (NAS) algorithms adopt neural predictors to accelerate the architecture search. The capability of neural predictors to accurately predict the performance metrics of neural architecture is critical to NAS, and the acquisition of training datasets for neural predictors is time-consuming. How to obtain a neural predictor with high prediction accuracy using a small amount of training data is a central problem to neural predictor-based NAS. Here, we firstly design a new architecture encoding scheme that overcomes the drawbacks of existing vector-based architecture encoding schemes to calculate the graph edit distance of neural architectures. To enhance the predictive performance of neural predictors, we devise two self-supervised learning methods from different perspectives to pre-train the architecture embedding part of neural predictors to generate a meaningful representation of neural architectures. The first one is to train a carefully designed two branch graph neural network model to predict the graph edit distance of two input neural architectures. The second method is inspired by the prevalently contrastive learning, and we present a new contrastive learning algorithm that utilizes a central feature vector as a proxy to contrast positive pairs against negative pairs. Experimental results illustrate that the pre-trained neural predictors can achieve comparable or superior performance compared with their supervised counterparts with several times less training samples. We achieve state-of-the-art performance on the NASBench-101 and NASBench201 benchmarks when integrating the pre-trained neural predictors with an evolutionary NAS algorithm.

PaperPDFCodeCode Syntology ran

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):

Code

Syntology 13 code samples harvested from 1 repository linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 13 samples from 1 repository, 10 ran (10 with no instrument failure; 0 where Syntology's instrument failed). 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 on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

auroua/SSNENAS officialmentioned in papermentioned on GitHubpytorchMITSyntology: 13 samples, 10 ran (0 instrument-failed) · 3 unverified report

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

13 samples harvested: 10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 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.

10ran
3unverified

Licence: 0 of the 13 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 auroua/SSNENAS. “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.

auroua/SSNENAS official repository 13 samples, 10 ran (0 instrument-failed) · 3 unverified
acq_fn nas_lib/algos_nas/acquisition_functions.py ran MIT (permissive) · 8e50b14abde79c1b · report fixture: signature predictions:ndarray/2/float, explore_type:str/0/str, reverse:bool/0/bool · returned ndarray · level recorded 2026-09-25
algo_params_close_domain nas_lib/params_nas.py ran MIT (permissive) · 96ee1ba824202f2b · report fixture: signature param_str:str/0/str, search_budget:int/0/int, dataname:str/0/str · returned list · level recorded 2026-09-25
algo_params_open_domain nas_lib/params_nas.py ran MIT (permissive) · c38b7508cdb1f030 · report fixture: signature param_str:str/0/str · returned dict · level recorded 2026-09-25
compute_best_test_losses nas_lib/algos_nas/algo_compare.py ran fingerprinted MIT (permissive) · cb94f7ba1f7afae8 · report fixture: signature data:list/1/tuple, k:int/0/int, total_queries:int/0/int · returned list · level recorded 2026-09-25
evolution_search_nasbench_101 nas_lib/algos_nas/evolution.py ran MIT (permissive) · 7f5760af9d9e1fdb · report fixture: signature search_space:MinimalSearchSpace/0/?, num_init:int/0/int, k:int/0/int, population_size:int/0/int, total_queries:int/0/int, tournament_size:int/0/int, mutation_rate:float/0/float, allow_isomorphisms:bool/0/bool, deterministic:bool/0/bool, verbose:int/0/int, logger:Logger/0/? · returned list · level recorded 2026-09-25
meta_neuralnet_params in 5 papers nas_lib/params_nas.py ran MIT (permissive) · fd6439b6def33330 · report fixture: signature param_str:str/0/str · returned dict · level recorded 2026-09-25
quick_sort_list nas_lib/algos/algo_sort.py ran MIT (permissive) · 383278a1ef55d3cd · report fixture: signature nums:list/1/tuple · returned list · level recorded 2026-09-25
supervised_ss_rl_params nas_lib/params.py ran MIT (permissive) · 33da0703810ce533 · report fixture: signature param_str:str/0/str · returned dict · level recorded 2026-09-25
unsupervised_ss_rl_params nas_lib/params.py ran MIT (permissive) · 4aa9f462c2fbfbcb · report fixture: signature param_str:str/0/str · returned dict · level recorded 2026-09-25
unsupervised_ss_rl_pre_train nas_lib/params.py ran MIT (permissive) · ac8329f01f864a9e · report fixture: signature param_str:str/0/str · returned dict · level recorded 2026-09-25
build_open_algos nas_lib/algos_darts/build_open_algos.py unverified MIT (permissive) · b86e1c4f11405bbc · report
run_nas_algos_nasbench_101 nas_lib/algos_nas/algo_compare.py unverified MIT (permissive) · d9cc4398d1baf37a · report
run_nas_algos_nasbench_201 nas_lib/algos_nas/algo_compare.py unverified MIT (permissive) · d6d169f03ec8c6ea · report

Tasks

Contrastive LearningGraph Neural NetworkNeural Architecture SearchRepresentation LearningSelf-Supervised Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive LearningGraph Neural Network

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