Sequential Preconditioned Conjugate Gradient Method for Linear Statistical Models

arXiv:2607.25272 2026 Optimization 1 ideas extracted · analyzed Aug 31, 2026

What the math gives to ML

The paper's transferable contribution is a continuation strategy for large least-squares systems: solve a sequence of increasingly accurate sketched problems, warm-start each solve from the previous solution, and reserve a short full-data refinement for the end. This can turn expensive repeated Jacobian or feature-matrix products into mostly cheap computations on small row subsets while retaining the accuracy of the full normal-equation solution. The most direct neural-network use is solving linearized Gauss-Newton or last-layer/LoRA least-squares subproblems, where the same large design matrix is repeatedly used and conjugate-gradient iterations are otherwise dominated by full-batch matrix products.

Ideas from this paper

Unverified 2026

Sequential Sketched Gauss-Newton

Replace a costly full-data conjugate-gradient solve for a neural-network linearized least-squares step with a sequence of progressively larger sketched solves. Each solve starts from the previous solution, so early iterations cheaply identify the useful update direction and only the final few iterations use the full training batch.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Sequential Preconditioned Conjugate Gradient Method for Linear Statistical Models arXiv:2607.25272