Research map / Optimization / Nonconvex and smooth optimization
A2BCD: Asynchronous Acceleration with Optimal Complexity
Robert Hannah, Fei Feng, Wotao Yin
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
- Asynchronous Coordinate Descent under More Realistic Assumptions (NeurIPS 2017 · similarity 0.92)
- Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems (AAAI 2019 · similarity 0.90)
- Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees (JMLR 2023 · similarity 0.90)
- Accelerating Greedy Coordinate Descent Methods (ICML 2018 · similarity 0.89)
- Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares (ICML 2024 · similarity 0.88)
- Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (NeurIPS 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.
