Research map / Optimization / Distributed and compressed
Optimal Convergence Rates for Convex Distributed Optimization in Networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, Laurent Massoulié
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
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (NeurIPS 2018 · similarity 0.97)
- Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks (NeurIPS 2024 · similarity 0.94)
- Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks (ICML 2017 · similarity 0.93)
- Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization (NeurIPS 2020 · similarity 0.93)
- Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers (ICML 2024 · similarity 0.90)
- Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity (NeurIPS 2024 · similarity 0.89)
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.
