Asynchronous Evolution of Deep Neural Network Architectures
Jason Liang, Hormoz Shahrzad, Risto Miikkulainen

TL;DR
This paper introduces an asynchronous evaluation strategy (AES) that significantly speeds up evolutionary neural architecture search by reducing idle time among compute nodes, demonstrated across multiple design tasks.
Contribution
The paper proposes a generic AES method that improves parallel evaluation efficiency in evolutionary algorithms, especially for neural architecture search with variable evaluation times.
Findings
Over two-fold speedup in sorting network design
14-fold speedup in multiplexer design
Over two-fold speedup in image captioning ENAS
Abstract
Many evolutionary algorithms (EAs) take advantage of parallel evaluation of candidates. However, if evaluation times vary significantly, many worker nodes (i.e.,\ compute clients) are idle much of the time, waiting for the next generation to be created. Evolutionary neural architecture search (ENAS), a class of EAs that optimizes the architecture and hyperparameters of deep neural networks, is particularly vulnerable to this issue. This paper proposes a generic asynchronous evaluation strategy (AES) that is then adapted to work with ENAS. AES increases throughput by maintaining a queue of up to individuals ready to be sent to the workers for evaluation and proceeding to the next generation as soon as individuals have been evaluated. A suitable value for is determined experimentally, balancing diversity and efficiency. To showcase the generality and power of AES, it was…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications · Neural Networks and Applications
