Research map / Optimization / Nonconvex and smooth optimization
Lower Bounds for Parallel and Randomized Convex Optimization
Jelena Diakonikolas, Cristóbal Guzmán
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
- Complexity of Highly Parallel Non-Smooth Convex Optimization (NeurIPS 2019 · similarity 0.92)
- Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness (NeurIPS 2021 · similarity 0.90)
- Tight Complexity Bounds for Optimizing Composite Objectives (NeurIPS 2016 · similarity 0.89)
- Communication Lower Bounds for Distributed Convex Optimization: Partition Data on Features (AAAI 2017 · similarity 0.89)
- Smooth Convex Optimization Using Sub-Zeroth-Order Oracles (AAAI 2021 · similarity 0.89)
- Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model (NeurIPS 2023 · 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.
