Pith. sign in

REVIEW 1 cited by

Scaling Laws For Deep Learning Based Image Reconstruction

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 2209.13435 v2 pith:CITUMKLL submitted 2022-09-27 eess.IV cs.AIcs.CVcs.LGstat.ML

classification eess.IVcs.AIcs.CVcs.LGstat.ML
keywords scalingtrainingimageperformancedeepsizetrainederror
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep neural networks trained end-to-end to map a measurement of a (noisy) image to a clean image perform excellent for a variety of linear inverse problems. Current methods are only trained on a few hundreds or thousands of images as opposed to the millions of examples deep networks are trained on in other domains. In this work, we study whether major performance gains are expected from scaling up the training set size. We consider image denoising, accelerated magnetic resonance imaging, and super-resolution and empirically determine the reconstruction quality as a function of training set size, while simultaneously scaling the network size. For all three tasks we find that an initially steep power-law scaling slows significantly already at moderate training set sizes. Interpolating those scaling laws suggests that even training on millions of images would not significantly improve performance. To understand the expected behavior, we analytically characterize the performance of a linear estimator learned with early stopped gradient descent. The result formalizes the intuition that once the error induced by learning the signal model is small relative to the error floor, more training examples do not improve performance.

Discussion (0). Sign in 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. Out-of-distribution data supervision towards biomedical semantic segmentation

    cs.CV 2025-07 reject novelty 4.0 of 10

    Med-OoD adds background-only 'OOD' patches from the ID dataset as negative samples with zero-mask Dice loss, claiming modest gains on Lizard but an internally inconsistent 76.1% mIoU for the OOD-only case.

Pith tools