NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search
Xuanyi Dong, Yi Yang
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper198
- Neural Architecture Search without TrainingJoe Mellor, Jack Turner, Amos Storkey, Elliot J. CrowleyICML 2021 · 被引用 477 次
- BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture SearchColin White, Willie Neiswanger, Yash SavaniAAAI 2021 · 被引用 401 次
- FairNAS: Rethinking Evaluation Fairness of Weight Sharing Neural Architecture SearchXiangxiang Chu, Bo Zhang, Ruijun XuICCV 2021 · 被引用 362 次
- BRP-NAS: Prediction-based NAS using GCNsLukasz Dudziak, Thomas Chau, Mohamed S. Abdelfattah, Royson Lee 等NeurIPS 2020 · 被引用 233 次
- Rethinking Architecture Selection in Differentiable NASRuochen Wang, Minhao Cheng, Xiangning Chen, Xiaocheng Tang 等ICLR 2021 · 被引用 213 次
它引用的顶会 Paper3
- Evaluating The Search Phase of Neural Architecture SearchKaicheng Yu, Christian Sciuto, Martin Jaggi, Claudiu Musat 等ICLR 2020 · 被引用 370 次
- One-Shot Neural Architecture Search via Self-Evaluated Template NetworkXuanyi Dong, Yi YangICCV 2019 · 被引用 206 次
- NAS-Bench-1Shot1: Benchmarking and Dissecting One-shot Neural Architecture SearchArber Zela, Julien Siems, Frank HutterICLR 2020 · 被引用 156 次
相关 Paper
- NAS evaluation is frustratingly hardAntoine Yang, Pedro M. Esperança, Fabio Maria CarlucciICLR 2020 · 被引用 180 次
- NAS-Bench-Suite: NAS Evaluation is (Now) Surprisingly EasyYash Mehta, Colin White, Arber Zela, Arjun Krishnakumar 等ICLR 2022 · 被引用 54 次
- Surrogate NAS Benchmarks: Going Beyond the Limited Search Spaces of Tabular NAS BenchmarksArber Zela, Julien Niklas Siems, Lucas Zimmer, Jovita Lukasik 等ICLR 2022 · 被引用 100 次
- ReNAS: Relativistic Evaluation of Neural Architecture SearchYixing Xu, Yunhe Wang, Kai Han, Yehui Tang 等CVPR 2021
- Understanding Architectures Learnt by Cell-based Neural Architecture SearchYao Shu, Wei Wang, Shaofeng CaiICLR 2020 · 被引用 92 次
