Last-Iterate Convergence of Stochastic Gradient Methods for Unbounded Problems
math.OC, cs.LG, stat.ML
Submitted: 2026-11-05
Updated: 2026-11-05
Comments: 31 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Towards Weaker Variance Assumptions for Stochastic Optimization
- Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
- SGD for Variational Inference: Tackling Unbounded Variance via Preconditioning and Dynamic Batching
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