Skip to content
Open access

On convergence rates of stochastic gradient descent for linear inverse problems

Sep 2026 · Numerische Mathematik · 0 citations · 12 references

Abstract

Stochastic gradient methods have gained increasing attention for solving large-scale inverse problems due to their computational efficiency. However, their theoretical justification in the context of ill-posed problems remains underdeveloped, particularly regarding convergence rate analysis, where existing results typically yield only suboptimal rates. In this paper, we address this gap by establishing order-optimal convergence rates for a stochastic gradient method applied to linear ill-posed problems in Hilbert spaces. Under Hölder-type source conditions with smoothness parameter $$\nu \in (0, 1/2]$$ ν ∈ ( 0 , 1 / 2 ] , we derive convergence rates both in expectation and almost surely, accommodating a broad class of step-size sequences, including constant and polynomially decaying ones. Our analysis is based on a delicate Lyapunov-type argument and an application of the Robbins–Siegmund theorem. As a byproduct, we also establish new convergence results that do not rely on any source conditions.

Read PDF

Similar papers

Preprint Sep 2026

Subspace methods for min-max problems

Four groups of subspace methods for nonlinear monotone equations, with applications to large-scale machine learning problems, using Jacobian-free subspace directions of conjugate-gradient type combined with either fixed step sizes or variable step sizes generated by the projected method of Solodov and Svaiter are intro...

M. Kimiaei, Shima Shabani, Michael Breuß · 0 citations
Preprint Sep 2026

Early stopping of stochastic variance reduced gradient for linear inverse problems by the discrepancy principle

Stochastic variance reduced gradient (SVRG) is a variant of stochastic gradient descent and is a promising iterative method for solving large-scale inverse problems. Nevertheless, the development of theoretically grounded a posteriori stopping rules for SVRG remains an open challenge. In this work, we provide a converg...

Bang-Ti Jin, Ze-Hui Zhou · 0 citations
Open access Sep 2026

Convergence Rates of Levenberg–Marquardt Regularization Under General Source Conditions

We investigate the convergence of the Levenberg–Marquardt (LM) iterative regularization method for linear ill-posed inverse problems in Hilbert spaces under general source conditions characterized by admissible index functions. We introduce admissibility conditions tailored to the spectral filter structure of the LM it...

P. Pornsawad, N. Chumchob, Wannapa Panitsupakamon · 0 citations
Preprint Oct 2026

Regularity for solutions to inhomogeneous degenerate parabolic $p$-Laplace equations

For weak solutions to quasilinear degenerate parabolic equations of $p$-Laplace type, a central obstacle in applying the method of intrinsic scaling to prove their H\"{o}lder regularity is the derivation of forward-in-time propagation estimate for the spatial measure of level sets. In this paper, we revisit and overcom...

Xia Hao, Yan Li, Zhi-Wen Zhao · 0 citations

Global convergence of a coderivative-based regularized Newton method with damping for nonsmooth optimization

A globally convergent regularized Newton method with positive definite regularization for solving nonsmooth optimization problems that replaces the identity matrix in traditional algorithms with a general positive-definite symmetric matrix to regularize the generalized Hessian.

Wei Ouyang, Zhenghong Tan, JiangxingZhu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.