Research map / Optimization / Nonconvex and smooth optimization
From Low Probability to High Confidence in Stochastic Convex Optimization
Damek Davis, Dmitriy Drusvyatskiy, Lin Xiao, Junyu Zhang
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
- The Sample Complexity of Parameter-Free Stochastic Convex Optimization (JMLR 2026 · similarity 0.91)
- Local Minimax Complexity of Stochastic Convex Optimization (NeurIPS 2016 · similarity 0.91)
- Safe Online Convex Optimization with Heavy-Tailed Observation Noises (AAAI 2025 · similarity 0.90)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.90)
- Universal Gradient Methods for Stochastic Convex Optimization (ICML 2024 · similarity 0.89)
- Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions (NeurIPS 2024 · 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.
