Research map / Optimization / Nonconvex and smooth optimization
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| know both L and mu (side information) | oblivious p-CLIs · smooth strongly convex | iteration complexity lower bound | Hurt |
| know only L, not mu | oblivious p-CLIs · smooth functions | dependence on kappa | Hurt |
| use standard GD with 1/L steps when mu is underestimated | GD vs accelerated oblivious algorithm · smooth strongly convex | iteration complexity | Helped |
| stationary p-CLI on smooth convex functions | stationary p-CLIs · L-smooth convex | convergence rate exponent alpha | Hurt |
Closest papers by meaning
- Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness (NeurIPS 2021 · similarity 0.91)
- Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints (NeurIPS 2024 · similarity 0.88)
- On The Complexity of First-Order Methods in Stochastic Bilevel Optimization (ICML 2024 · similarity 0.88)
- Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness (ICLR 2025 · similarity 0.88)
- On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition (ICML 2024 · similarity 0.88)
- Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods (ICLR 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.