Bias-Optimal Bounds for Stochastic Gradient Descent
math.OC, cs.LG, stat.ML
Submitted: 2025-05-23
Updated: 2026-11-13
Code: https://github.com/DanielCortild/Bias-Optimal-SGD
Terminology
Sources
- Towards Weaker Variance Assumptions for Stochastic Optimization
- Defining Lyapunov functions as the solution of a performance estimation saddle point problem
- Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
- Handbook of Convergence Theorems for (Stochastic) Gradient Methods
- Clarabel: An interior-point solver for conic programs with quadratic objectives
- A Unified Theory of Stochastic Proximal Point Methods without Smoothness
- Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
- Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition
- Revisiting Stochastic Proximal Point Methods: Generalized Smoothness and Similarity
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