Research map / Optimization / Nonconvex and smooth optimization
Lower Bounds for Smooth Nonconvex Finite-Sum Optimization
Dongruo Zhou, Quanquan Gu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace component-wise smoothness with the weaker average-smoothness assumption in existing algorithms' analyses | SDCA without Duality, Natasha, KatyushaX, RapGrad, StagewiseKatyusha, and RepeatSVRG · Nonconvex finite-sum optimization | IFO calls | No clear effect |
Closest papers by meaning
- Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction (JMLR 2024 · similarity 0.93)
- Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization (ICML 2025 · similarity 0.89)
- Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (NeurIPS 2024 · similarity 0.88)
- On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition (ICML 2024 · similarity 0.88)
- Quantum Algorithms and Lower Bounds for Finite-Sum Optimization (ICML 2024 · similarity 0.88)
- High-probability complexity bounds for stochastic non-convex minimax optimization (NeurIPS 2024 · 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.
