Skip to content
conftrace_

communication complexity

119 papers

Papers

The communication cost of security and privacy in federated frequency estimation AISTATS 2023 Unbiased Compression Saves Communication in Distributed Optimization: When and How Much? NeurIPS 2023 Acceleration in Distributed Optimization under Similarity AISTATS 2022 A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks NeurIPS 2022 Coresets for Vertical Federated Learning: Regularized Linear Regression and K-Means Clustering NeurIPS 2022 Distributed Optimization for Overparameterized Problems: Achieving Optimal Dimension Independent Communication Complexity NeurIPS 2022 Efficient Decentralized Stochastic Gradient Descent Method for Nonconvex Finite-Sum Optimization Problems AAAI 2022 Escaping Saddle Points with Bias-Variance Reduced Local Perturbed SGD for Communication Efficient Nonconvex Distributed Learning NeurIPS 2022 Multi-Agent Multi-Armed Bandits with Limited Communication JMLR 2022 On the Convergence of Local Stochastic Compositional Gradient Descent with Momentum ICML 2022 Optimal Algorithms for Decentralized Stochastic Variational Inequalities NeurIPS 2022 Optimal Gradient Sliding and its Application to Optimal Distributed Optimization Under Similarity NeurIPS 2022 Permutation Compressors for Provably Faster Distributed Nonconvex Optimization ICLR 2022 Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022 ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally! ICML 2022 SAGDA: Achieving O(ε^-2) Communication Complexity in Federated Min-Max Learning NeurIPS 2022 Towards Optimal Communication Complexity in Distributed Non-Convex Optimization NeurIPS 2022 Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization JMLR 2022 Average-Case Communication Complexity of Statistical Problems COLT 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 Communication-Efficient Distributed Optimization with Quantized Preconditioners ICML 2021 DeEPCA: Decentralized Exact PCA with Linear Convergence Rate JMLR 2021 Distributed Saddle-Point Problems Under Data Similarity NeurIPS 2021 Escaping Saddle Points with Compressed SGD NeurIPS 2021