Research map / Optimization / Nonconvex and smooth optimization
On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis
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.92)
- The Statistical Complexity of Early-Stopped Mirror Descent (NeurIPS 2020 · similarity 0.90)
- Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization (ICLR 2019 · similarity 0.90)
- Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise (NeurIPS 2023 · similarity 0.89)
- Multiclass Loss Geometry Matters for Generalization of Gradient Descent in Separable Classification (NeurIPS 2025 · similarity 0.87)
- The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations (ICML 2025 · similarity 0.87)
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.