Pith. sign in

REVIEW 2 cited by

AutoML-Zero: Evolving Machine Learning Algorithms From Scratch

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 2003.03384 v2 pith:VPNCBKUR submitted 2020-03-06 cs.LG cs.NEstat.ML

classification cs.LGcs.NEstat.ML
keywords algorithmslearningmachinenetworksneuralsearchautomlbuilding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Machine learning research has advanced in multiple aspects, including model structures and learning methods. The effort to automate such research, known as AutoML, has also made significant progress. However, this progress has largely focused on the architecture of neural networks, where it has relied on sophisticated expert-designed layers as building blocks---or similarly restrictive search spaces. Our goal is to show that AutoML can go further: it is possible today to automatically discover complete machine learning algorithms just using basic mathematical operations as building blocks. We demonstrate this by introducing a novel framework that significantly reduces human bias through a generic search space. Despite the vastness of this space, evolutionary search can still discover two-layer neural networks trained by backpropagation. These simple neural networks can then be surpassed by evolving directly on tasks of interest, e.g. CIFAR-10 variants, where modern techniques emerge in the top algorithms, such as bilinear interactions, normalized gradients, and weight averaging. Moreover, evolution adapts algorithms to different task types: e.g., dropout-like techniques appear when little data is available. We believe these preliminary successes in discovering machine learning algorithms from scratch indicate a promising new direction for the field.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. LLM-Driven Neural Network Generation with Same-Family Architecture Guidance: Disentangling Transfer and Adaptation

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Same-family source guidance lets LLMs improve weak neural nets over non-source controls, with recipe adaptation (not mere copy) explaining large SVHN AlexNet gains.

  2. Searching the Space of Feed-Forward Neural-Network Weight-Update Rules with Fixed Depth Symbolic Regression

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Symbolic regression over fixed-depth expressions found neural-network weight-update rules that beat tuned standard optimizers on 25 of 30 small benchmark/NN setups, but evaluation used the same data for selection and ...

Pith tools