Pith. sign in

REVIEW

Regularized Evolutionary Algorithm for Dynamic Neural Topology 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 1905.06252 v2 pith:LGZ5HX4X submitted 2019-05-15 cs.NE cs.CV

classification cs.NEcs.CV
keywords evolutionarynetworkalgorithmalgorithmsarchitecturearchitecturesdynamicindividuals
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Designing neural networks for object recognition requires considerable architecture engineering. As a remedy, neuro-evolutionary network architecture search, which automatically searches for optimal network architectures using evolutionary algorithms, has recently become very popular. Although very effective, evolutionary algorithms rely heavily on having a large population of individuals (i.e., network architectures) and is therefore memory expensive. In this work, we propose a Regularized Evolutionary Algorithm with low memory footprint to evolve a dynamic image classifier. In details, we introduce novel custom operators that regularize the evolutionary process of a micro-population of 10 individuals. We conduct experiments on three different digits datasets (MNIST, USPS, SVHN) and show that our evolutionary method obtains competitive results with the current state-of-the-art.

Discussion (0). Sign in to comment.

Pith tools