Aug 2026· Future generations computer systems· Vol 186, pp. 108743· 0 citations· 54 references
Computer Science
TL;DR
FedA2L is introduced, a method that dynamically adjusts layer-wise LRs based on model divergence signals that achieves up to 4.94 times faster convergence than vanilla DFL and reduces communication rounds by up to 59% compared to scheduler-based baselines.
Abstract
Decentralized intelligence systems with heterogeneous devices and limited coordination increasingly rely on decentralized federated learning (DFL). However, DFL suffers from convergence inefficiency under data heterogeneity due to the use of a uniform learning rate (LR) that ignores layer-specific optimization needs. Foundational layers are responsible for maintaining network consensus, while specialized layers adapt to local data characteristics, leading to conflicting gradients and degraded performance under non-IID conditions. To address this fundamental tension, this work introduces FedA2L, a method that dynamically adjusts layer-wise LRs based on model divergence signals. By leveraging local update intensity and network consensus constraints, FedA2L seamlessly integrates into existing DFL protocols without additional communication or coordination. Extensive evaluations across DFL algorithms, various model architectures, and datasets demonstrate that FedA2L achieves up to 4.94 times faster convergence than vanilla DFL and reduces communication rounds by up to 59% compared to scheduler-based baselines. Furthermore, FedA2L exhibits resilience to severe data heterogeneity, larger network sizes, and sparse topologies, reducing communication overhead and establishing it as a versatile optimization tool for resource-constrained or large-scale distributed learning in edge and IoT deployments. The code is released at https://github.com/nclabteam/FedA2L.
Estimation error provably converges to zero as training progresses and HaFedHo surpasses state-of-the-art methods, including SCAFFOLD, MimeLite, and FedDyn, in both test accuracy and communication efficiency.
Jian-Rong Lu, Bang-Wei Li, Zhuo-Ya Gu et al.· Proceedings of the Thirty-Fi...· 0 citations
A federated random walk averaging framework is proposed, which is a variant of federated averaging (FedAvg) that mitigates data heterogeneity by updating models along random walk (RW) paths and aggregating them at the server and reduces the problem to a general form agnostic to task type and model architecture.
Chang-Heng Wang, Xian-Chao Zhang, Zhi-Qing Wei et al.· 0 citations
Decentralized federated learning (DFL) has emerged as a promising alternative to centralized federated learning by eliminating communication bottlenecks at a single server. However, prior studies on DFL typically assume wireless-network-like settings and measure communication cost simply as the number of transfer desti...
Kengo Tajiri, R. Kawahara· International Conference on...· 0 citations
Asynchronous Federated Learning (AFL) addresses the synchronization bottleneck of traditional federated learning by allowing clients to upload local model updates independently. However, asynchronous communication can result in stale updates, whose optimization information can become outdated in cases of heterogeneous...
Rahmatullah Arrizal Pranatadesta, Duy-Linh Nguyen, A. Priadana et al.· 2026 International Workshop...· 0 citations
Experimental results demonstrate that the proposed framework improves convergence, accuracy, scalability, and signal-to-noise ratio, data rate, while simultaneously reducing latency, and energy consumption for both CIFAR-10 and FEMNIST datasets compared with the FedProx, FedADMM, LyFeD and FL-MEC benchmark schemes.
Kofi Kwarteng Abrokwa, Qi Jiang, Zhou-Qin Ma et al.· IEEE Transactions on Green C...· 0 citations
The Federated Parallel Scaling (FPS) algorithm is proposed, which jointly trains multiple sampled subnetworks in parallel with self-distillation so that larger sampled subnetworks can supervise smaller ones during local updates.
Jia-Xin Zhang, Xing-Wei Wang, Bo Yi et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.