Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
Not on the map. Why?
Abstract (arXiv)
We investigate the Stochastic Krasnoselskii-Mann iterations for expected nonexpansive fixed-point problems in a real separable Hilbert space. We establish convergence guarantees under significantly weaker assumptions on the variance than those typically used in the literature. In particular, instead of a uniform bound on the variance of the stochastic oracle, we only assume finite variance at a single fixed point. Under this assumption, we prove almost sure weak convergence of the iterates, derive convergence rates for the expected residual and the last-iterate residual, and obtain almost sure convergence rates for the running minimum residual. Notably, we recover the best-known stochastic oracle complexity without imposing uniformly bounded variance. We illustrate the applicability of our results to Stochastic Gradient Descent, where we recover known guarantees, to Stochastic Three-Operator Splitting and Stochastic Backward-Forward Splitting, for which we obtain the first results that avoid uniform variance bounds, and to a novel Stochastic Lifted Three-Operator Splitting.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Apr 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Quadratic Objective Perturbation: Curvature-Based Differential Privacycited by 1
- 2026Non-Expansive Two-Time-Scale Stochastic Approximation: A Fixed-Schedule One-Quarter Barrier and Bias-Corrected Accelerationcited by 0
- 2026Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumptioncited by 0
- 2026Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Mapscited by 0
- 2026Stochastic Inertial Krasnosel'skii-Mann Iteration Achieves Near-Optimal Sample Complexitycited by 0
- 2026Stochastic Inertial Krasnosel'skii-Mann Iteration Achieves Near-Optimal Sample Complexity22 Sep 2026
- 2026Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps8 Sep 2026
- 2026Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumption6 Sep 2026
- 2026Non-Expansive Two-Time-Scale Stochastic Approximation: A Fixed-Schedule One-Quarter Barrier and Bias-Corrected Acceleration15 Jul 2026
- 2026Quadratic Objective Perturbation: Curvature-Based Differential Privacy7 May 2026