{"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":"/code/train-and-eval","entry":"train_and_eval","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2107.00860","paper":"/paper/rapid-neural-architecture-search-by-learning-1","title":"Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/AutoDL-Projects","path":"exps/NAS-Bench-201-algos/R_EA.py","file_url":"https://github.com/D-X-Y/AutoDL-Projects/blob/HEAD/exps/NAS-Bench-201-algos/R_EA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ab9fd355247f264","mcp_get_code":{"code_sha256":"1ab9fd355247f264"}},{"arxiv_id":"2006.07556","paper":"/paper/neural-architecture-search-using-bayesian","title":"Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman Kernels","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/nas_benchmarks","path":"experiment_scripts/run_regularized_evolution.py","file_url":"https://github.com/automl/nas_benchmarks/blob/HEAD/experiment_scripts/run_regularized_evolution.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"17e87ce4fcceba76","mcp_get_code":{"code_sha256":"17e87ce4fcceba76"}},{"arxiv_id":"2006.04492","paper":"/paper/revisiting-the-train-loss-an-efficient","title":"Speedy Performance Estimation for Neural Architecture Search","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rubinxin/TSE","path":"query_based_nas/run_regularized_evolution.py","file_url":"https://github.com/rubinxin/TSE/blob/HEAD/query_based_nas/run_regularized_evolution.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"17e87ce4fcceba76","mcp_get_code":{"code_sha256":"17e87ce4fcceba76"}},{"arxiv_id":"2001.00326","paper":"/paper/nas-bench-102-extending-the-scope-of","title":"NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search","date":"2020-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/NAS-Projects","path":"exps/NAS-Bench-201-algos/R_EA.py","file_url":"https://github.com/D-X-Y/NAS-Projects/blob/HEAD/exps/NAS-Bench-201-algos/R_EA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ab9fd355247f264","mcp_get_code":{"code_sha256":"1ab9fd355247f264"}},{"arxiv_id":"1910.05733","paper":"/paper/one-shot-neural-architecture-search-via-self","title":"One-Shot Neural Architecture Search via Self-Evaluated Template Network","date":"2019-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/GDAS","path":"exps/NAS-Bench-201-algos/R_EA.py","file_url":"https://github.com/D-X-Y/GDAS/blob/HEAD/exps/NAS-Bench-201-algos/R_EA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ab9fd355247f264","mcp_get_code":{"code_sha256":"1ab9fd355247f264"}},{"arxiv_id":"1906.03158","paper":"/paper/matching-the-blanks-distributional-similarity","title":"Matching the Blanks: Distributional Similarity for Relation Learning","date":"2019-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dfki-nlp/mtb-bert-em","path":"src/mtb/train_eval.py","file_url":"https://github.com/dfki-nlp/mtb-bert-em/blob/HEAD/src/mtb/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e50b2589e0455d1f","mcp_get_code":{"code_sha256":"e50b2589e0455d1f"}}]}