Research map / Optimization / Nonconvex and smooth optimization
Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex Optimization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Polyak-type momentum rather than vanilla SGD | Stochastic optimization on robust phase retrieval · Robust phase retrieval | robustness to problem and algorithm parameters | Helped |
| Use Polyak-type momentum rather than vanilla SGD | Stochastic optimization on robust phase retrieval · Robust phase retrieval | range of initial stepsizes with convergence | Helped |
| Use momentum values 1−β=0.9 or 1−β=0.99 | SHB · Robust phase retrieval | range of algorithm parameters yielding good approximate solutions | Helped |
Closest papers by meaning
- Non-convex Stochastic Composite Optimization with Polyak Momentum (ICML 2024 · similarity 0.93)
- Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity (ICLR 2025 · similarity 0.91)
- Random Scaling and Momentum for Non-smooth Non-convex Optimization (ICML 2024 · similarity 0.90)
- Stochastic Momentum Methods for Non-smooth Non-Convex Finite-Sum Coupled Compositional Optimization (NeurIPS 2025 · similarity 0.90)
- Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis (NeurIPS 2025 · similarity 0.90)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 2024 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.