Research map / Optimization / Nonconvex and smooth optimization
Almost Sure Convergence Rates Analysis and Saddle Avoidance of Stochastic Gradient Methods
Jun Liu, Ye Yuan
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
- Taming Stochastic Gradient Descent: Almost Sure Convergence and Saddle-Point Avoidance under $(L_{0},L_{1})$-Smoothness (ICML 2026 · similarity 0.92)
- On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems (NeurIPS 2020 · similarity 0.91)
- Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods (ICLR 2024 · similarity 0.91)
- Universal Gradient Methods for Stochastic Convex Optimization (ICML 2024 · similarity 0.90)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.90)
- Gradient correlation is a key ingredient to accelerate SGD with momentum (ICLR 2025 · 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.
