Pith. sign in

REVIEW 2 cited by

Measuring the Algorithmic Efficiency of Neural Networks

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 2005.04305 v1 pith:YYPNM6BR submitted 2020-05-08 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords algorithmiccomputeefficiencyprogressdataadvancealexnet-levelamount
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Three factors drive the advance of AI: algorithmic innovation, data, and the amount of compute available for training. Algorithmic progress has traditionally been more difficult to quantify than compute and data. In this work, we argue that algorithmic progress has an aspect that is both straightforward to measure and interesting: reductions over time in the compute needed to reach past capabilities. We show that the number of floating-point operations required to train a classifier to AlexNet-level performance on ImageNet has decreased by a factor of 44x between 2012 and 2019. This corresponds to algorithmic efficiency doubling every 16 months over a period of 7 years. By contrast, Moore's Law would only have yielded an 11x cost improvement. We observe that hardware and algorithmic efficiency gains multiply and can be on a similar scale over meaningful horizons, which suggests that a good model of AI progress should integrate measures from both.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 87 citations worldwide. Full citation record

  1. A Theory of Inference Compute Scaling: Reasoning through Directed Stochastic Skill Search

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A skill-graph random-walk model gives closed-form accuracy-versus-compute formulas for four reasoning strategies and connects them to training scaling.

  2. Hybrid Quantum Neural Networks: Theory, Implementations, and Applications

    quant-ph 2026-08 conditional novelty 2.0 of 10

    A balanced review of hybrid quantum neural networks, concluding that quantum layers help on structured, small-scale and quantum-native problems but do not yet beat classical models on generic benchmarks.

Pith tools