Stochastic Inertial Krasnosel'skii-Mann Iteration Achieves Near-Optimal Sample Complexity

arXiv:2609.28543 · stat.ML, cs.LG, math.OC · Submitted 2026-09-22 · Read on arXiv

stat.ML, cs.LG, math.OC

Submitted: 2026-09-22

Updated: 2026-09-22

Terminology

• Sample Complexity — 16× in this paper · explained in 15 episodes
• Hilbert Space — 4× in this paper · explained in 2 episodes
• Regularization — 3× in this paper · explained in 3 episodes
• Accuracy — 2× in this paper · explained in 1 episode
• Reinforcement Learning — 2× in this paper · explained in 4 episodes
• Generalization — 1× in this paper · explained in 13 episodes

Sources

• Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
• Convergence analysis of an inexact inertial Krasnoselskii-Mann algorithm with applications
• Solving Stochastic Fixed-Point Equations with High Probability
• Mini-Batch Stochastic Krasnosel'ski\u\i-Mann Algorithm for Nonexpansive Fixed Point Problems
• A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
• Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization

Related papers

• Behavior of prediction performance metrics with rare events
• Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
• A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
• One Permutation Is All You Need: Fast, Deterministic Feature Importance and Model Stress-Testing
• Online Conformal Prediction for Non-Exchangeable Panel Data
• Deep Time-Series Forecasting in 10 Years: A Survey