Pith. sign in

REVIEW 1 cited by

NATS-Bench: Benchmarking NAS Algorithms for Architecture Topology and Size

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.00437 v6 pith:SAPPYJPT submitted 2020-08-28 cs.LG stat.ML

classification cs.LGstat.ML
keywords algorithmsarchitecturenats-benchperformancesearchsearchingsizetopology
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural architecture search (NAS) has attracted a lot of attention and has been illustrated to bring tangible benefits in a large number of applications in the past few years. Architecture topology and architecture size have been regarded as two of the most important aspects for the performance of deep learning models and the community has spawned lots of searching algorithms for both aspects of the neural architectures. However, the performance gain from these searching algorithms is achieved under different search spaces and training setups. This makes the overall performance of the algorithms to some extent incomparable and the improvement from a sub-module of the searching model unclear. In this paper, we propose NATS-Bench, a unified benchmark on searching for both topology and size, for (almost) any up-to-date NAS algorithm. NATS-Bench includes the search space of 15,625 neural cell candidates for architecture topology and 32,768 for architecture size on three datasets. We analyze the validity of our benchmark in terms of various criteria and performance comparison of all candidates in the search space. We also show the versatility of NATS-Bench by benchmarking 13 recent state-of-the-art NAS algorithms on it. All logs and diagnostic information trained using the same setup for each candidate are provided. This facilitates a much larger community of researchers to focus on developing better NAS algorithms in a more comparable and computationally cost friendly environment. All codes are publicly available at: https://xuanyidong.com/assets/projects/NATS-Bench.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Finding Optimal Kernel Size and Dimension in Convolutional Neural Networks An Architecture Optimization Approach

    cs.CV 2025-06 reject novelty 3.0 of 10

    A proposed BKSEF heuristic for layer-wise CNN kernel sizes is presented, but the formula is ad hoc and the reported validation is missing from the paper.

Pith tools