Research map / Optimization / Nonconvex and smooth optimization
All ERMs Can Fail in Stochastic Convex Optimization Lower Bounds in Linear Dimension
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
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.93)
- Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back (NeurIPS 2016 · similarity 0.93)
- On Traceability in $\ell_p$ Stochastic Convex Optimization (NeurIPS 2025 · similarity 0.89)
- Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing (ICML 2024 · similarity 0.88)
- Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.88)
- Rapid Overfitting of Multi-Pass SGD in Stochastic Convex Optimization (ICML 2025 · 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.