DARTS: Differentiable Architecture Search
Hanxiao Liu, Karen Simonyan, Yiming Yang
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/quark0/dartsOfficialIn paperpytorch★ 0
- github.com/osmr/imgclsmobmxnet★ 3,015
- github.com/open-mmlab/mmrazorpytorch★ 1,664
- github.com/D-X-Y/AutoDL-Projectspytorch★ 1,588
- github.com/D-X-Y/NAS-Projectspytorch★ 1,588
- github.com/leopard-ai/bettypytorch★ 346
- github.com/guoyongcs/NATpytorch★ 58
- github.com/eml-eda/pliniopytorch★ 48
- github.com/guoyongcs/NATv2pytorch★ 23
- github.com/nutellamok/advrushpytorch★ 12
Abstract
This paper addresses the scalability challenge of architecture search by formulating the task in a differentiable manner. Unlike conventional approaches of applying evolution or reinforcement learning over a discrete and non-differentiable search space, our method is based on the continuous relaxation of the architecture representation, allowing efficient search of the architecture using gradient descent. Extensive experiments on CIFAR-10, ImageNet, Penn Treebank and WikiText-2 show that our algorithm excels in discovering high-performance convolutional architectures for image classification and recurrent architectures for language modeling, while being orders of magnitude faster than state-of-the-art non-differentiable techniques. Our implementation has been made publicly available to facilitate further research on efficient architecture search algorithms.
Tasks
Benchmark Results
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| Penn Treebank (Word Level) | Differentiable NAS | Test perplexity | 56.1 | — | Unverified |