2 code implementations • NeurIPS 2020 • Colin White, Willie Neiswanger, Sam Nolen, Yash Savani
First we formally define architecture encodings and give a theoretical characterization on the scalability of the encodings we study Then we identify the main encoding-dependent subroutines which NAS algorithms employ, running experiments to show which encodings work best with each subroutine for many popular algorithms.
2 code implementations • 6 May 2020 • Colin White, Sam Nolen, Yash Savani
In this work, we show that (1) the simplest hill-climbing algorithm is a powerful baseline for NAS, and (2), when the noise in popular NAS benchmark datasets is reduced to a minimum, hill-climbing to outperforms many popular state-of-the-art algorithms.