TL;DR
This paper demonstrates that a modified evolutionary algorithm can automatically discover image classifier architectures that outperform or match human-designed models, achieving state-of-the-art accuracy on ImageNet with less computational effort.
Contribution
It introduces an age-based tournament selection in evolution, enabling the discovery of superior neural network architectures like AmoebaNet-A for image classification.
Findings
AmoebaNet-A surpasses hand-designed models in accuracy.
Evolution can find high-quality architectures faster than reinforcement learning.
AmoebaNet-A achieves a new state-of-the-art 83.9% / 96.6% top-5 ImageNet accuracy.
Abstract
The effort devoted to hand-crafting neural network image classifiers has motivated the use of architecture search to discover them automatically. Although evolutionary algorithms have been repeatedly applied to neural network topologies, the image classifiers thus discovered have remained inferior to human-crafted ones. Here, we evolve an image classifier---AmoebaNet-A---that surpasses hand-designs for the first time. To do this, we modify the tournament selection evolutionary algorithm by introducing an age property to favor the younger genotypes. Matching size, AmoebaNet-A has comparable accuracy to current state-of-the-art ImageNet models discovered with more complex architecture-search methods. Scaled to larger size, AmoebaNet-A sets a new state-of-the-art 83.9% / 96.6% top-5 ImageNet accuracy. In a controlled comparison against a well known reinforcement learning algorithm, we give…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAging Evolution · Label Smoothing · Dropout · RMSProp · ScheduledDropPath · Cosine Annealing · SGD with Momentum · Weight Decay · Spatially Separable Convolution · Max Pooling
