Research map / Optimization / Nonconvex and smooth optimization
Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase Retrieval
Yan Shuo Tan, Roman Vershynin
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Online stochastic gradient descent on non-convex losses from high-dimensional inference (JMLR 2021 · similarity 0.92)
- Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors (NeurIPS 2021 · similarity 0.90)
- Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson–Romberg Extrapolation (ICLR 2025 · similarity 0.89)
- Statistical Guarantees for High-Dimensional Stochastic Gradient Descent (NeurIPS 2025 · similarity 0.88)
- Coupling-based Convergence Diagnostic and Stepsize Scheme for Stochastic Gradient Descent (AAAI 2025 · similarity 0.88)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · 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.
