Research map / Optimization / Nonconvex and smooth optimization
Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
Kevin Kurian Thomas Vaidyan, Michael Friedlander, Ahmet Alacaoglu
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
- Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization (JMLR 2021 · similarity 0.92)
- Fast Rate Analysis of Some Stochastic Optimization Algorithms (ICML 2016 · similarity 0.90)
- Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems (NeurIPS 2019 · similarity 0.90)
- Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization (ICML 2025 · similarity 0.89)
- Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods (ICLR 2024 · similarity 0.89)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · 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.
