SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2007.03331 · 2020

GOLD-NAS: Gradual, One-Level, Differentiable

arXiv · PDF · Open in the Atlas

Code that ran

2 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 0 failures of our instrument; 3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2007.03331.json · badge: /api/ran/2007.03331.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
sunsmarterjie/GOLD_NAS community (classifier label)
classifier basis not recorded on the link
2 ran · 3 no recorded run
FunctionStatusWhere it lives
flops_computation Ran
ran on a synthesized input
sunsmarterjie/GOLD_NAS/cifar_search/model_search.py
code served (permissive licence) · get_code("5bb659c7b666e283")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
import numpy as np

torch.manual_seed(0)

# Analyzing the function:
# - ci: used in arithmetic (division, multiplication) - should be numeric
# - c: used in arithmetic (division) - should be numeric
# - op_id: compared to 1 and 0 - should be int
# - skip_in_reduction: used in boolean condition - should be bool

ARGS = {
    "ci": 16,
    "c": 32,
    "op_id": 1,
    "skip_in_reduction": True
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type float, ndim 0, dtype family float, shape () — shape () as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
node_computation Ran
ran on a synthesized input
sunsmarterjie/GOLD_NAS/cifar_search/model_search.py
code served (permissive licence) · get_code("68d769559b742df1")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
import numpy as np

torch.manual_seed(0)

# The function expects:
# - weights_node: an iterable of iterables (nested structure) where each inner element can be divided by a scalar
# - eta_min: a numeric threshold value

# Create a small 2D tensor to represent weights_node
# Each row represents an edge, each column represents an operation weight
weights_node = torch.tensor([
    [0.5, 0.3, 0.1, 0.2],
    [0.4, 0.6, 0.2, 0.1]
], dtype=torch.float32)

eta_min = 0.15

ARGS = {
    "weights_node": weights_node,
    "eta_min": eta_min
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type tuple, ndim 1, dtype family float — a tuple output has no array shape of its own; none is stated
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
accuracy Not yet run
unverified (harvested, no recorded run)
sunsmarterjie/GOLD_NAS/cifar_search/utils.py
pointer only (licence: Apache-2.0); the stored copy get_code serves, from yuxwind/exactcompression, is pointer only (licence: NONE) · get_code("469bf48752905889")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from yuxwind/exactcompression, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

count_parameters_in_MB Not yet run
unverified (harvested, no recorded run)
sunsmarterjie/GOLD_NAS/cifar_search/utils.py
code served (permissive licence) · get_code("3e816289579cc9e9")
How it ran

no invocation recorded.

drop_path Not yet run
unverified (harvested, no recorded run)
sunsmarterjie/GOLD_NAS/cifar_search/utils.py
pointer only (licence: Apache-2.0); the stored copy get_code serves, from hyeonjeongha/croze, is pointer only (licence: NONE) · get_code("13c2719404e25b25")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hyeonjeongha/croze, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 3 the same month, 3 later) and 2 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
accuracy 71 other papers
35 dated earlier, 4 the same month, 32 later · 2 only as an assembly brick
1505.05424 (2015-05)
Weight Uncertainty in Neural Networks
1705.07204 (2017-05)
Ensemble Adversarial Training: Attacks and Defenses
1802.10399 (2018-02)
Compressing Neural Networks using the Variational Information Bottleneck
and 68 more not named here
count_parameters_in_MB 8 other papers
4 dated earlier, 1 the same month, 3 later
1806.09055 (2018-06)
DARTS: Differentiable Architecture Search
1912.00195 (2019-12)
SGAS: Sequential Greedy Architecture Search
2004.14557 (2020-04)
Learning Deformable Image Registration from Optimization: Perspective, Modules, Bilevel Training and Beyond
and 5 more not named here
drop_path 6 other papers
3 dated earlier, 1 the same month, 2 later
1806.09055 (2018-06)
DARTS: Differentiable Architecture Search
1912.00195 (2019-12)
SGAS: Sequential Greedy Architecture Search
2006.16537 (2020-06)
Theory-Inspired Path-Regularized Differential Network Architecture Search
and 3 more not named here

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

There has been a large literature of neural architecture search, but most existing work made use of heuristic rules that largely constrained the search flexibility. In this paper, we first relax these manually designed constraints and enlarge the search space to contain more than $10^{160}$ candidates. In the new space, most existing differentiable search methods can fail dramatically. We then propose a novel algorithm named Gradual One-Level Differentiable Neural Architecture Search (GOLD-NAS) which introduces a variable resource constraint to one-level optimization so that the weak operators are gradually pruned out from the super-network. In standard image classification benchmarks, GOLD-NAS can find a series of Pareto-optimal architectures within a single search procedure. Most of the discovered architectures were never studied before, yet they achieve a nice tradeoff between recognition accuracy and model complexity. We believe the new space and search algorithm can advance the search of differentiable NAS.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2007.03331")
get_code_for_paper("2007.03331")
have("2007.03331")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2007.03331.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2007.03331.svg)](https://syntology.ai/paper/2007.03331)

Connect an agent — have() is free.