arxiv
PublishedJune 2, 2026 at 4:00 AM
Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
Publisher summary· verbatim
arXiv:2512.02342v3 Announce Type: replace-cross Abstract: The stochastic Polyak step size (SPS) has proven to be a promising choice for stochastic gradient descent (SGD), delivering competitive performance relative to state-of-the-art methods on smooth convex and non-convex optimization problems, in
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSFMambaNet: Spectral-Frequency Enhanced Selective State Space Model for Correspondence Pruning1harxivOptical-Guided Neural Collapse for SAR Few-Shot Class Incremental Learning1harxivDynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models1harxivTemporal Order Matters for Agentic Memory: Segment Trees for Long-Horizon Agents1hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗