Pith. sign in

REVIEW 1 cited by

A Survey on Evolutionary Neural Architecture Search

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.10937 v4 pith:U5GX3ZGG submitted 2020-08-25 cs.NE

classification cs.NE
keywords designmethodsneuralarchitecturearchitecturesdnnsec-basedevolutionary
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep Neural Networks (DNNs) have achieved great success in many applications. The architectures of DNNs play a crucial role in their performance, which is usually manually designed with rich expertise. However, such a design process is labour intensive because of the trial-and-error process, and also not easy to realize due to the rare expertise in practice. Neural Architecture Search (NAS) is a type of technology that can design the architectures automatically. Among different methods to realize NAS, Evolutionary Computation (EC) methods have recently gained much attention and success. Unfortunately, there has not yet been a comprehensive summary of the EC-based NAS algorithms. This paper reviews over 200 papers of most recent EC-based NAS methods in light of the core components, to systematically discuss their design principles as well as justifications on the design. Furthermore, current challenges and issues are also discussed to identify future research in this emerging field.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Model Successors

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A meta-learner that transforms a model for difficulty level k into a model for level k+1 can generalize far beyond its training range, demonstrated on a bracket-matching task.

Pith tools