Windowed and Quantized Group-Based ADMM for Distributed Optimization in Heterogeneous Edge Networks
This paper proposes WQ-GADMM, a method for distributed optimization in edge networks that reduces communication costs and maintains test accuracy.
This paper presents a novel method for distributed optimization in edge networks that reduces communication costs and maintains test accuracy, improving upon prior work in this area.
Before reading this…
Applications
- →edge networks
- →distributed machine learning
To understand this paper, make sure you know these concepts first:
- machine learningfind papers →
- optimization methodsfind papers →
Abstract
More Like ThisDistributed optimization in edge networks is constrained by heterogeneous client computing capabilities and limited communication resources. We propose the Windowed and Quantized Group-Based Alternating Direction Method of Multipliers (WQ-GADMM) to coordinate group updates under limited activation capacity and reduce communication costs. Clients are grouped by estimated computation time. Each window activates a limited number of groups per round, and the cloud updates the global model after all groups have updated once. The method quantizes both downlink and uplink model exchanges to reduce communication costs and allows bounded model staleness and inexact proximal local updates. For smooth nonconvex objectives, we establish an average squared Karush-Kuhn-Tucker residual bound under the stated assumptions and parameter conditions. The bound consists of a term that decreases with the iteration count and a quantization-dependent error term. Experiments on MNIST and CIFAR-10 show that 12-bit communication reduces communication volume and simulated wall-clock time while maintaining test accuracy comparable to full precision. The 12-bit configuration also maintains complete group coverage and achieves shorter mean group inter-completion gaps than the evaluated baselines.