12-bit communication reduces communication volume and simulated wall-clock time while maintaining test accuracy comparable to full precision and an average squared Karush-Kuhn-Tucker residual bound is established under the stated assumptions and parameter conditions.
Abstract
Distributed 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.
The Alternating Direction Method of Multipliers (ADMM) is widely used for distributed optimization, but its synchronous implementation can suffer from efficiency loss in heterogeneous edge networks, where fast clients or groups need to wait for slower ones before global updates can be completed. Existing group-based AD...
Gai-Guo Wei, Qing-Ying Zhang, He-Qiang Wang et al.· 1 citation
Distributed optimization over networks requires agents to repeatedly exchange decision variables with their neighbors. When the decision dimension $d$ is large, these exchanges dominate the communication cost, which is critical for bandwidth-constrained agents. Existing remedies quantize or sparsify the exchanged vecto...
This paper provides a complete Lyapunov-based convergence analysis for the fixed-step-size regime and addresses local box constraints via smooth penalty relaxation and quantify explicitly how the penalty weight interacts with the step-size bound and the optimality gap.
Distributed Radio Resource Management (RRM) is a fundamental challenge in 6G wireless networks, particularly under dynamic user demands, multilayer inter-cell interference, and heterogeneous QoS constraints. Centralized optimization solutions are often infeasible in practice due to signaling delay and the lack of syste...
T. Vu, Cuong Le, S. Chatzinotas· IEEE International Symposium...· 0 citations
The proposed MADDPG algorithm outperforms benchmark algorithms such as CO (Cloud-Only), GO (Greedy Offloading), SEP (Static Expert Partitioning), DDPG (Deep Deterministic Policy Gradient), COMA (Counterfactual Multi-Agent Policy Gradients), and MAPPO (Multi-Agent Proximal Policy Optimization) in terms of average iterat...
De-Feng Duan, Hong Liu, Li-Yu Huang et al.· Tsinghua Science and Technol...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.