Research map / Optimization / Nonconvex and smooth optimization
Decentralized Accelerated Proximal Gradient Descent
Read the paperCheck your idea against 108,967 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use DAPG (accelerated, multi-consensus, gradient tracking) instead of PG-EXTRA, NIDS and DPA | decentralized sparse logistic regression · a9a and w8a | computation and communication cost to reach accuracy | Helped |
| increase FastMix steps K from 1 to 3 in DAPG (ablation) | DAPG · a9a and w8a | communication cost | No clear effect |
Closest papers by meaning
- A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization (NeurIPS 2019 · similarity 0.94)
- Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization (NeurIPS 2020 · similarity 0.90)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 2024 · similarity 0.88)
- Implicit Regularization of Decentralized Gradient Descent for Sparse Regression (NeurIPS 2024 · similarity 0.88)
- Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence (AAAI 2025 · similarity 0.87)
- Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization (ICML 2025 · 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.