FTSO: Effective NAS via First Topology Second Operator

Likang Wang, Lei Chen
2/28/2023
cs.CVcs.LG

No confident code implementation found for this paper.

Abstract

Existing one-shot neural architecture search (NAS) methods have to conduct a search over a giant super-net, which leads to the huge computational cost. To reduce such cost, in this paper, we propose a method, called FTSO, to divide the whole architecture search into two sub-steps. Specifically, in the first step, we only search for the topology, and in the second step, we search for the operators. FTSO not only reduces NAS's search time from days to 0.68 seconds, but also significantly improves the found architecture's accuracy. Our extensive experiments on ImageNet show that within 18 seconds, FTSO can achieve a 76.4% testing accuracy, 1.5% higher than the SOTA, PC-DARTS. In addition, FTSO can reach a 97.77% testing accuracy, 0.27% higher than the SOTA, with nearly 100% (99.8%) search time saved, when searching on CIFAR10.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2023ftso,
  title  = {FTSO: Effective NAS via First Topology Second Operator},
  author = {Likang Wang and Lei Chen},
  year   = {2023},
  eprint = {2303.12948},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.12948v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.12948.svg)](https://codeofpaper.com/paper/2303.12948)

Discussion