Early stopping for conjugate gradients in statistical inverse problems
Laura Hucker, Markus Rei{\ss}

TL;DR
This paper analyzes early stopping rules for the conjugate gradient method in statistical inverse problems, establishing optimal convergence rates and proposing a data-driven stopping rule that performs well in practice.
Contribution
It provides a comprehensive error analysis of early stopping for CG in statistical inverse problems, including a new data-driven stopping rule with proven optimal rates.
Findings
Optimal convergence rates for prediction and reconstruction errors.
A data-driven early stopping rule that attains these rates.
Numerical results demonstrating practical effectiveness.
Abstract
We consider estimators obtained by iterates of the conjugate gradient (CG) algorithm applied to the normal equation of prototypical statistical inverse problems. Stopping the CG algorithm early induces regularisation, and optimal convergence rates of prediction and reconstruction error are established in wide generality for an ideal oracle stopping time. Based on this insight, a fully data-driven early stopping rule is constructed, which also attains optimal rates, provided the error in estimating the noise level is not dominant. The error analysis of CG under statistical noise is subtle due to its nonlinear dependence on the observations. We provide an explicit error decomposition and identify two terms in the prediction error, which share important properties of classical bias and variance terms. Together with a continuous interpolation between CG iterates, this paves the way…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods in inverse problems
