GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning
arXiv:1909.00047
Abstract
When the data is distributed across multiple servers, lowering the communication cost between the servers (or workers) while solving the distributed learning problem is an important problem and is the focus of this paper. In particular, we propose a fast, and communication-efficient decentralized framework to solve the distributed machine learning (DML) problem. The proposed algorithm, Group Alternating Direction Method of Multipliers (GADMM) is based on the Alternating Direction Method of Multipliers (ADMM) framework. The key novelty in GADMM is that it solves the problem in a decentralized topology where at most half of the workers are competing for the limited communication resources at any given time. Moreover, each worker exchanges the locally trained model only with two neighboring workers, thereby training a global model with a lower amount of communication overhead in each exchange. We prove that GADMM converges to the optimal solution for convex loss functions, and numerically show that it converges faster and more communication-efficient than the state-of-the-art communication-efficient algorithms such as the Lazily Aggregated Gradient (LAG) and dual averaging, in linear and logistic regression tasks on synthetic and real datasets. Furthermore, we propose Dynamic GADMM (D-GADMM), a variant of GADMM, and prove its convergence under the time-varying network topology of the workers.
References in corpus (9)
- Communication-Efficient Learning of Deep Networks from Decentralized Data
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- Communication-Efficient On-Device Machine Learning: Federated Distillation and Augmentation under Non-IID Private Data
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Distributed Mean Estimation with Limited Communication
- Communication-Efficient Distributed Dual Coordinate Ascent
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks
- Proximity Without Consensus in Online Multi-Agent Optimization
- Quantized Consensus ADMM for Multi-Agent Distributed Optimization
Cited by in corpus (8)
- Edge Learning for B5G Networks with Distributed Signal Processing: Semantic Communication, Edge Computing, and Wireless Sensing
- Opportunities of Federated Learning in Connected, Cooperative and Automated Industrial Systems
- Multi-Stage Hybrid Federated Learning over Large-Scale D2D-Enabled Fog Networks
- Towards Energy Efficient Distributed Federated Learning for 6G Networks
- Decentralized and Model-Free Federated Learning: Consensus-Based Distillation in Function Space
- Learning, Computing, and Trustworthiness in Intelligent IoT Environments: Performance-Energy Tradeoffs
- Wireless Communications for Collaborative Federated Learning
- Rate-Distortion Theoretic Bounds on Generalization Error for Distributed Learning