Research map / Optimization / Nonconvex and smooth optimization
Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems
Ehsan Kazemi, Liqiang Wang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Use AAPCD instead of ASCD | Asynchronous proximal coordinate descent on rcv1 · rcv1 | objective value versus CPU time | Improved |
| Use AAPCD instead of AASCD | Asynchronous proximal coordinate descent on rcv1 · rcv1 | objective value versus CPU time | Improved |
| Use AAPCD instead of ASCD or AASCD | Asynchronous proximal coordinate descent on rcv1 · rcv1 | objective value | Improved |
| Use negative momentum for large delays (ablation) | AAPCD · rcv1 | convergence speed | Improved |
Closest papers by meaning
- A2BCD: Asynchronous Acceleration with Optimal Complexity (ICLR 2019 · similarity 0.90)
- Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization (ICML 2017 · similarity 0.90)
- Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization (JMLR 2022 · similarity 0.89)
- The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM (NeurIPS 2016 · similarity 0.89)
- Accelerating Greedy Coordinate Descent Methods (ICML 2018 · similarity 0.89)
- A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization (NeurIPS 2018 · 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.
