SpiderNet: Hybrid Differentiable-Evolutionary Architecture Search via Train-Free Metrics
Rob Geada, Andrew Stephen McGough

TL;DR
SpiderNet is a minimally-configured, hybrid differentiable-evolutionary NAS algorithm that efficiently discovers state-of-the-art neural networks with minimal user-defined parameters.
Contribution
It introduces a minimally-configured NAS method that dynamically evolves its search space, reducing the need for manual tuning and outperforming random search in multiple metrics.
Findings
Produces state-of-the-art networks efficiently
Outperforms random search in accuracy and resource usage
Requires only two user-defined parameters
Abstract
Neural Architecture Search (NAS) algorithms are intended to remove the burden of manual neural network design, and have shown to be capable of designing excellent models for a variety of well-known problems. However, these algorithms require a variety of design parameters in the form of user configuration or hard-coded decisions which limit the variety of networks that can be discovered. This means that NAS algorithms do not eliminate model design tuning, they instead merely shift the burden of where that tuning needs to be applied. In this paper, we present SpiderNet, a hybrid differentiable-evolutionary and hardware-aware algorithm that rapidly and efficiently produces state-of-the-art networks. More importantly, SpiderNet is a proof-of-concept of a minimally-configured NAS algorithm; the majority of design choices seen in other algorithms are incorporated into SpiderNet's…
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
TopicsNeural Networks and Applications · Evolutionary Algorithms and Applications · Metaheuristic Optimization Algorithms Research
MethodsRandom Search
