Research map / Federated learning and privacy / Communication-efficient FL
A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
Alexander Tyurin, Peter Richtárik
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 |
|---|---|---|---|
| reduce participation to s=10 of n=100 nodes (probability 1/10) (ablation) | DASHA-PP · real-sim, finite-sum and stochastic | convergence speed (gradient norm vs communication rounds): approximately x10 slower | Hurt |
| reduce participation to s=1 of n=100 nodes (probability 1/100) (ablation) | DASHA-PP · real-sim, finite-sum and stochastic | convergence speed (gradient norm vs communication rounds): approximately x100 slower | Hurt |
| use DASHA-PP instead of MARINA under partial participation with RandK | DASHA-PP · real-sim and MNIST, finite-sum | convergence (gradient norm vs rounds) | Improved |
| use DASHA-PP instead of FRECON in finite-sum setting | DASHA-PP · real-sim and MNIST, finite-sum | final accuracy of solution | Improved |
| use DASHA-PP instead of MARINA and FRECON in stochastic setting | DASHA-PP · real-sim and MNIST, stochastic | convergence (gradient norm) | Improved |
| increase participation probability toward 1 (ablation) | DASHA-PP vs DASHA · real-sim | convergence rate gap to DASHA | Improved |
Closest papers by meaning
- Towards Faster Decentralized Stochastic Optimization with Communication Compression (ICLR 2025 · similarity 0.88)
- Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates (ICLR 2024 · similarity 0.87)
- Federated Optimization with Doubly Regularized Drift Correction (ICML 2024 · similarity 0.87)
- Stabilized Proximal-Point Methods for Federated Optimization (NeurIPS 2024 · similarity 0.87)
- Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization (AAAI 2024 · similarity 0.87)
- Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity (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.
