SGAS: Sequential Greedy Architecture Search

Abstract

Architecture design has become a crucial component of successful deep learning. Recent progress in automatic neural architecture search (NAS) shows a lot of promise. However, discovered architectures often fail to generalize in the final evaluation. Architectures with a higher validation accuracy during the search phase may perform worse in the evaluation. Aiming to alleviate this common issue, we introduce sequential greedy architecture search (SGAS), an efficient method for neural architecture search. By dividing the search procedure into sub-problems, SGAS chooses and prunes candidate operations in a greedy fashion. We apply SGAS to search architectures for Convolutional Neural Networks (CNN) and Graph Convolutional Networks (GCN). Extensive experiments show that SGAS is able to find state-of-the-art architectures for tasks such as image classification, point cloud classification and node classification with minimal computational cost.

Resources

arXiv: 1912.00195

Video

Citation

@inproceedings{li2020sgas,
  title     = {{SGAS}: Sequential Greedy Architecture Search},
  author    = {Li, Guohao and Qian, Guocheng and Delgadillo, Itzel C. and M{\"{u}}ller, Matthias and Thabet, Ali and Ghanem, Bernard},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year      = {2020}
}