Research map / Optimization / Nonconvex and smooth optimization
Stochastic Mirror Descent in Variationally Coherent Optimization Problems
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.
Closest papers by meaning
- Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities (NeurIPS 2018 · similarity 0.91)
- Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems (NeurIPS 2021 · similarity 0.90)
- Methods for Optimization Problems with Markovian Stochasticity and Non-Euclidean Geometry (AAAI 2026 · similarity 0.90)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · similarity 0.88)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.88)
- Stochastic Optimization with Random Search (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.