Research map / Optimization / Nonconvex and smooth optimization
Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction
Yuze Han, Guangzeng Xie, Zhihua Zhang
Read the paperCheck your idea against 137,217 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
- Lower Bounds for Smooth Nonconvex Finite-Sum Optimization (ICML 2019 · similarity 0.93)
- Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems (ICML 2020 · similarity 0.93)
- Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum Optimization (ICML 2022 · similarity 0.90)
- On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition (ICML 2024 · similarity 0.90)
- Quantum Algorithms and Lower Bounds for Finite-Sum Optimization (ICML 2024 · similarity 0.87)
- Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers (ICML 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.
