Research map / Optimization / Nonconvex and smooth optimization
Convergence of adaptive algorithms for constrained weakly convex optimization
Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 AMSGrad instead of SGD | robust phase retrieval · Robust phase retrieval, kappa 1/10/100 | epochs to reach f(x)-f* <= 0.1 across initial step sizes | Improved |
| use AMSGrad instead of SGD with momentum (SHB) | robust phase retrieval · Robust phase retrieval, kappa 1/10/100 | epochs to reach f(x)-f* <= 0.1 across initial step sizes | Improved |
| add momentum to SGD (SHB) | SGD · Robust phase retrieval | robustness to initial step size | Improved |
Closest papers by meaning
- Stochastic Weakly Convex Optimization beyond Lipschitz Continuity (ICML 2024 · similarity 0.90)
- Zeroth-Order Methods for Constrained Nonconvex Nonsmooth Stochastic Optimization (ICML 2024 · similarity 0.89)
- Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness (ICLR 2025 · similarity 0.88)
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.88)
- Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions (NeurIPS 2024 · similarity 0.88)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.88)
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.
