NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search

By Xuanyi Dong, Yi Yang. 2020

863 citations recorded by the source corpus.

Neural architecture search (NAS) has achieved breakthrough success in a great number of applications in the past few years. It could be time to take a step back and analyze the good and bad aspects in the field of NAS. A variety of algorithms search architectures under different search space. These searched architectures are trained using different setups, e.g., hyper-parameters, data augmentation, regularization. This raises a comparability problem when comparing the performance of various NAS algorithms. NAS-Bench-101 has shown success to alleviate this problem. In this work, we propose an extension to NAS-Bench-101: NAS-Bench-201 with a different search space, results on multiple datasets, and more diagnostic information. NAS-Bench-201 has a fixed search space and provides a unified benchmark for almost any up-to-date NAS algorithms. The design of our search space is inspired by the one used in the most popular cell-based searching algorithms, where a cell is represented as a directed acyclic graph. Each edge here is associated with an operation selected from a predefined operation set. For it to be applicable for all NAS algorithms, the search space defined in NAS-Bench-201 includes all possible architectures generated by 4 nodes and 5 associated operation options, which results in 15,625 neural cell candidates in total. The training log using the same setup and the performance for each architecture candidate are provided for three datasets. This allows researchers to avoid unnecessary repetitive training for selected architecture and focus solely on the search algorithm itself. The training time saved for every architecture also largely improves the efficiency of most NAS algorithms and presents a more computational cost friendly NAS community for a broader range of researchers. We provide additional diagnostic information such as fine-grained loss and accuracy, which can give inspirations to new designs of NAS algorithms. In further support of the proposed NAS-Bench-102, we have analyzed it from many aspects and benchmarked 10 recent NAS algorithms, which verify its applicability.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Evaluation & Benchmarks, Neural Architecture Search & AutoML

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Quoc V. Le
  2. Sergey Levine
  3. Yoshua Bengio
  4. Mohit Bansal
  5. Dacheng Tao
  6. Xiaodan Liang
  7. Jianfeng Gao
  8. Percy Liang

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Yi Yang
  4. Xiaogang Wang
  5. Trevor Darrell
  6. Alan L. Yuille
  7. Xiaodan Liang
  8. Bernt Schiele

In Evaluation & Benchmarks

  1. Xuanyi Dong
  2. Colin White
  3. Yash Savani
  4. Marius Thomas Lindauer
  5. Mingxing Tan
  6. Sam Nolen
  7. Amos J. Storkey
  8. Bogdan Gabrys

In Neural Architecture Search & AutoML

  1. Colin White
  2. Yash Savani
  3. Sam Nolen
  4. Xiaojun Chang
  5. Willie Neiswanger
  6. Bogdan Gabrys
  7. Marius Thomas Lindauer
  8. Bo Zhang

Citations in the corpus