Searching for A Robust Neural Architecture in Four GPU Hours

Code

• github.com/D-X-Y/NAS-Projects
  OfficialIn paperpytorch★ 1,588
• github.com/D-X-Y/AutoDL-Projects
  pytorch★ 1,588
• github.com/rwbfd/OpenCompetitionV2
  pytorch★ 40
• github.com/epfl-ml-reproducers/subspace-attack-reproduction
  pytorch★ 8
• github.com/xxlya/COS598D_Assignment1
  pytorch★ 0
• github.com/D-X-Y/GDAS
  pytorch★ 0

Abstract

Conventional neural architecture search (NAS) approaches are based on reinforcement learning or evolutionary strategy, which take more than 3000 GPU hours to find a good model on CIFAR-10. We propose an efficient NAS approach learning to search by gradient descent. Our approach represents the search space as a directed acyclic graph (DAG). This DAG contains billions of sub-graphs, each of which indicates a kind of neural architecture. To avoid traversing all the possibilities of the sub-graphs, we develop a differentiable sampler over the DAG. This sampler is learnable and optimized by the validation loss after training the sampled architecture. In this way, our approach can be trained in an end-to-end fashion by gradient descent, named Gradient-based search using Differentiable Architecture Sampler (GDAS). In experiments, we can finish one searching procedure in four GPU hours on CIFAR-10, and the discovered model obtains a test error of 2.82\% with only 2.5M parameters, which is on par with the state-of-the-art. Code is publicly available on GitHub: https://github.com/D-X-Y/NAS-Projects.

Tasks

Benchmark Results

Reproductions