communication complexity

Federated Deep AUC Maximization for Hetergeneous Data with a Constant Communication Complexity ICML 2021 Hogwild! over Distributed Local Data Sets with Linearly Increasing Mini-Batch Sizes AISTATS 2021 Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NeurIPS 2021 Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021 Newton Method over Networks is Fast up to the Statistical Precision ICML 2021 Rethinking gradient sparsification as total error minimization NeurIPS 2021 STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning NeurIPS 2021 STL-SGD: Speeding Up Local SGD with Stagewise Communication Period AAAI 2021 Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning NeurIPS 2021 Towards Tight Communication Lower Bounds for Distributed Optimisation NeurIPS 2021 Communication, Distortion, and Randomness in Metric Voting AAAI 2020 Decentralized Accelerated Proximal Gradient Descent NeurIPS 2020 Improved Communication Cost in Distributed PageRank Computation – A Theoretical Study ICML 2020 Improving the Sample and Communication Complexity for Decentralized Non-Convex Optimization: Joint Gradient Estimation and Tracking ICML 2020 Lower Bounds and Optimal Algorithms for Personalized Federated Learning NeurIPS 2020 Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NeurIPS 2020 Projection-free Distributed Online Convex Optimization with O(√T) Communication Complexity ICML 2020 Communication and Memory Efficient Testing of Discrete Distributions COLT 2019 Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters ICML 2019 Communication trade-offs for Local-SGD with large step size NeurIPS 2019 Distributed Inexact Newton-type Pursuit for Non-convex Sparse Learning AISTATS 2019 Distributed PageRank Computation: An Improved Theoretical Study AAAI 2019 Efficient and Thrifty Voting by Any Means Necessary NeurIPS 2019 Locally Private Learning without Interaction Requires Separation NeurIPS 2019 Lower Bounds for Locally Private Estimation via Communication Complexity COLT 2019