Decentralized Federated Learning (DFL) enables collaborative model training without central coordination. However, DFL faces challenges in dynamic networks, where existing methods struggle to balance consensus rate and communication efficiency, while overlooking practical issues such as topology variation. This paper presents Dynamic AirComp-enabled DFL (DA-DFL), a novel framework that integrates over-the-air computation (AirComp) with the BASE-GRAPH consensus algorithm for efficient DFL over dynamic topologies. The convergence analysis for DA-DFL under dynamic settings is conducted to reveal the influence of the consensus period and communication errors. We define communication overhead metrics, and jointly optimize transceiver beamformers and dynamic topologies. A topology matching algorithm is developed to reduce communication overhead by aligning logical and physical topologies. Experiments show significant gains of DA-DFL in communication efficiency, e.g., reducing communication links and distances by up to 42% and 50%, respectively, compared to benchmarks.
No takes yet. Share an insight, caveat, or question.
Feng et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: