Convergence of SVS-SPRING for linear least-quadratics

About 1 year old · traced to

Let JJ define a consistent instance of linear least-quadratics, let θ∗\theta^* be a solution, and assume an initial guess θ0∈range⁡(J⊤)\theta_0\in\operatorname{range}(J^\top). Let SVS(J,k,λ)(J,k,\lambda) denote the sampling distribution, and let α\alpha be as in, β\beta as in, and γ\gamma as in the stated LLQ theorem. With appropriate choices of η\eta and μ\mu, SPRING is expected to satisfy

E ∥θt−θ∗∥2=O((1−κ−1(H)⋅α/β  /  γ)t)∥θ0−θ∗∥2.\mathbb{E}\,\left\lVert \theta_t-\theta^*\right\rVert^2=\mathcal{O}\left(\left(1-\kappa^{-1}(H)\cdot\sqrt{\alpha/\beta}\;/\;\gamma\right)^t\right)\left\lVert\theta_0-\theta^*\right\rVert^2.

Convergence of SVS-SPRING for LLQ. Under these assumptions and the SVS(J,k,λ)(J,k,\lambda) sampling distribution, SPRING should satisfy the displayed convergence bound, where the hidden constant in O\mathcal{O} does not depend on tt. The conjecture proposes that SPRING accelerates SNG in the linear least-quadratics setting by replacing α\alpha with the accelerated sketch-and-project factor α/β\sqrt{\alpha/\beta}, modified by κ−1(H)/γ\kappa^{-1}(H)/\gamma. The paper states that the result is not currently proved because an appropriate Lyapunov function combining Nesterov acceleration with the nontrivial function-space Hessian is unclear.

References

Primary source

Gil Goldshlager, Jiang Hu and Lin Lin, “A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms”, arXiv:2508.21022 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.