Optimal Last-Iterate Bounds for Nonexpansive Stochastic Approximation
math.OC, cs.LG, cs.SY, eess.SY
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach
- Last-Iterate Guarantees for Learning in Co-coercive Games
- Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
- Solving Stochastic Fixed-Point Equations with High Probability
- Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps
- Mini-Batch Stochastic Krasnosel'ski\u\i-Mann Algorithm for Nonexpansive Fixed Point Problems
- Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed Point Problems
- A Banach-Space Theory of Markovian Halpern Iteration for Non-Expansive Maps
- Non-Expansive Two-Time-Scale Stochastic Approximation: A Fixed-Schedule One-Quarter Barrier and Bias-Corrected Acceleration
- Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition
- Stochastic Inertial Krasnosel'skii-Mann Iteration Achieves Near-Optimal Sample Complexity
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise