arXiv (All)
open access
The Last Iterate of the Projected Stochastic Subgradient Method Pays a Logarithm, Even in Dimension One
We prove that the projected stochastic subgradient method with the standard anytime stepsizes $η_t = γ/\sqrt t$ can suffer expected last-iterate optimization error of order $(\log n)/\sqrt n$ already on the real line. Combined with the classical in-expectation upper bound, this establishes the sharp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- New Bounds for the Last Iterate of the Stochastic subGradient Method#303191
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1043098
- Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization#1105436
- Sharp Minimax Rates for Highly Smooth Strongly Convex Zeroth-Order Optimization#1154899
Record · ID 1422935
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive