AI & ML
Bias-Optimal Bounds for Stochastic Gradient Descent
arXiv stat.ML0 views
arXiv:2505.17965v3 Announce Type: replace-cross Abstract: The non-asymptotic analysis of Stochastic Gradient Descent (SGD) typically yields bounds that decompose into a bias term and a variance term. In this work, we focus on the bias component and study the extent to which SGD can match the optimal convergence behavior of deterministic gradient descent. Assuming only (strong) convexity and smoothness of the objective, we derive new bounds for the full range of constant step-sizes $\gamma L \in (0,2)$. This includes critical and large step-size regimes that were previously unexplored without additional variance assumptions, in both the convex and strongly convex cases. Those bounds are bias-optimal, in the sense that the bias term coincides with the worst-case rate of gradient descent, for all non-critical step-sizes. For critical step-sizes, we show that no bounds can be obtained with an optimal bias term, but that this optimal bias can be approximated arbitrarily closely. As an immediate application, we provide new complexity bounds for the Stochastic Proximal algorithm, without the need of regularity assumptions.
Source:https://arxiv.org/abs/2505.17965PreviousBenign Overfitting for Regression with Trained Two-Layer ReLU NetworksNextEntropic smoothing and gradient approximation for Wasserstein distributionally robust optimization
Related posts
An LLM confidence score isn’t correctness: the certainty trap
0dev.to
What a host-side layer for LLM agents is, in plain words (and what it is not)
0dev.to
OpenAI's Agents API Lets Any App Rent Codex, Here's How It Works
0dev.to

94% of Singapore Small Business Owners Surveyed Say More AI Guidance Is Needed
0Meta Newsroom
Nashville, Tennessee Real Estate Dataset: 7,436 Listings, Excel File (Nov 10, 2026)
0dev.to Data
A Hundred and Eighty Six Thousand Pounds of Stock Had Left One Branch and Never Arrived at Another
0dev.to Data