Research map / Optimization / Nonconvex and smooth optimization
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems
Yossi Arjevani, Ohad Shamir
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 |
|---|---|---|---|
| Use mini-batches | Finite sum optimization methods · Finite sum optimization | iteration complexity | No clear effect |
| Sample individual functions without replacement instead of with replacement | Finite sum optimization methods · Finite sum optimization | iteration complexity | No clear effect |
| Use non-oblivious rather than oblivious optimization algorithms | Smooth strongly convex optimization · Smooth strongly convex optimization | convergence rate | Mixed |
Closest papers by meaning
- Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction (JMLR 2024 · similarity 0.90)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.86)
- Efficient Continual Finite-Sum Minimization (ICLR 2024 · similarity 0.85)
- Efficient Algorithms for Sum-Of-Minimum Optimization (ICML 2024 · similarity 0.85)
- Sample complexity of stochastic optimization with integer variables (NeurIPS 2026 · similarity 0.85)
- Quantum Algorithms and Lower Bounds for Finite-Sum Optimization (ICML 2024 · similarity 0.85)
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.
