← Keywords

communication complexity

99 papers

Explore in graph

Co-occurring keywords

distributed learning (563) distributed optimization (275) decentralized optimization (113) sample complexity (1158) stochastic gradient descent (1088) federated learning (1320) variance reduction (520) stochastic optimization (1060) stochastic gradient (296) regret bound (1918)

Papers

Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation ICML 2023
Representational Strengths and Limitations of Transformers NIPS 2023
Incremental Aggregated Riemannian Gradient Method for Distributed PCA AISTATS 2023
Dropout-Resilient Secure Multi-Party Collaborative Learning with Linear Communication Complexity AISTATS 2023
2Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression NIPS 2023
Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities NIPS 2023
Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis NIPS 2023
Unbiased Compression Saves Communication in Distributed Optimization: When and How Much? NIPS 2023
$\ell_p$-Regression in the Arbitrary Partition Model of Communication COLT 2023
Towards Optimal Communication Complexity in Distributed Non-Convex Optimization NIPS 2022
Escaping Saddle Points with Bias-Variance Reduced Local Perturbed SGD for Communication Efficient Nonconvex Distributed Learning NIPS 2022
Multi-Agent Multi-Armed Bandits with Limited Communication JMLR 2022
Optimal Gradient Sliding and its Application to Optimal Distributed Optimization Under Similarity NIPS 2022
Coresets for Vertical Federated Learning: Regularized Linear Regression and $K$-Means Clustering NIPS 2022
Distributed Optimization for Overparameterized Problems: Achieving Optimal Dimension Independent Communication Complexity NIPS 2022
Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization JMLR 2022
On the Convergence of Local Stochastic Compositional Gradient Descent with Momentum ICML 2022
Efficient Decentralized Stochastic Gradient Descent Method for Nonconvex Finite-Sum Optimization Problems AAAI 2022
Optimal Algorithms for Decentralized Stochastic Variational Inequalities NIPS 2022
A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks NIPS 2022
SAGDA: Achieving $\mathcal{O}(\epsilon^{-2})$ Communication Complexity in Federated Min-Max Learning NIPS 2022
ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally! ICML 2022
Acceleration in Distributed Optimization under Similarity AISTATS 2022
Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022
Towards Tight Communication Lower Bounds for Distributed Optimisation NIPS 2021