Pith. sign in

REVIEW 2 cited by

Algorithmic progress in computer vision

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 2212.05153 v4 pith:JEWAWVCK submitted 2022-12-10 cs.CV cs.LG

classification cs.CVcs.LG
keywords algorithmiccomputeprogressadvancescompute-augmentingcomputerscalingvision
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate algorithmic progress in image classification on ImageNet, perhaps the most well-known test bed for computer vision. We estimate a model, informed by work on neural scaling laws, and infer a decomposition of progress into the scaling of compute, data, and algorithms. Using Shapley values to attribute performance improvements, we find that algorithmic improvements have been roughly as important as the scaling of compute for progress computer vision. Our estimates indicate that algorithmic innovations mostly take the form of compute-augmenting algorithmic advances (which enable researchers to get better performance from less compute), not data-augmenting algorithmic advances. We find that compute-augmenting algorithmic advances are made at a pace more than twice as fast as the rate usually associated with Moore's law. In particular, we estimate that compute-augmenting innovations halve compute requirements every nine months (95\% confidence interval: 4 to 25 months).

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. Beyond Tokens: Enhancing RTL Quality Estimation via Structural Graph Learning

    cs.LG 2025-08 conditional novelty 6.0 of 10

    StructRTL uses self-supervised learning on control data flow graphs, plus knowledge distillation from post-mapping netlists, to beat prior LLM-based methods for predicting circuit area and delay from RTL code on a 13,...

  2. Literature Review Of Multi-Agent Debate For Problem-Solving

    cs.MA 2025-05 conditional novelty 4.0 of 10

    A literature review concludes that multi-agent LLM debate helps up to a task-dependent point, after which extra agents and rounds add cost without reliable gains.

Pith tools