← 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

Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning NIPS 2021
STL-SGD: Speeding Up Local SGD with Stagewise Communication Period AAAI 2021
Federated Deep AUC Maximization for Hetergeneous Data with a Constant Communication Complexity ICML 2021
Average-Case Communication Complexity of Statistical Problems COLT 2021
Newton Method over Networks is Fast up to the Statistical Precision ICML 2021
STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning NIPS 2021
Communication-Efficient Distributed Optimization with Quantized Preconditioners ICML 2021
Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning ICML 2021
Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA JMLR 2021
Hogwild! over Distributed Local Data Sets with Linearly Increasing Mini-Batch Sizes AISTATS 2021
Distributed Saddle-Point Problems Under Data Similarity NIPS 2021
Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021
Rethinking gradient sparsification as total error minimization NIPS 2021
Escaping Saddle Points with Compressed SGD NIPS 2021
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NIPS 2021
Improved Communication Cost in Distributed PageRank Computation – A Theoretical Study ICML 2020
Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NIPS 2020
Communication, Distortion, and Randomness in Metric Voting AAAI 2020
Projection-free Distributed Online Convex Optimization with $O(\sqrtT)$ Communication Complexity ICML 2020
Improving the Sample and Communication Complexity for Decentralized Non-Convex Optimization: Joint Gradient Estimation and Tracking ICML 2020
Decentralized Accelerated Proximal Gradient Descent NIPS 2020
Lower Bounds and Optimal Algorithms for Personalized Federated Learning NIPS 2020
Distributed PageRank Computation: An Improved Theoretical Study AAAI 2019
Efficient and Thrifty Voting by Any Means Necessary NIPS 2019
On Communication Complexity of Classification Problems COLT 2019