Decentralized Federated Learning Convergence Slowed by Network Heterogeneities

Arash Badie-Modiri, Chiara Boldrini, Lorenzo Valerio, J\'anos Kert\'esz, M\'arton Karsai· July 7, 2026 View original

▶ The 2-minute explainer

Summary

This study investigates decentralized federated learning over temporal networks, revealing that structural and temporal inhomogeneities in communication networks significantly slow down convergence. It maps the learning process to a lazy random-walk diffusion, showing that typical experimental setups often overestimate convergence speed by ignoring these real-world network complexities.

Decentralized federated learning (DFL) is gaining traction for on-device machine learning model training, offering benefits like privacy preservation, communication efficiency, and resilience against single points of failure. However, the impact of varying structures and time-dependent changes within the communication networks on DFL performance has been largely overlooked. This research delves into these "inhomogeneities" and their effects when model parameters are averaged locally during the aggregation phase. The study establishes a crucial link, demonstrating that the dynamics of DFL, both in its initial stages and its stable long-term behavior, mirror those of a lazy random-walk diffusion process on temporal networks. Based on this mapping, the authors contend that many experimental scenarios in DFL tend to show unrealistically fast convergence because they fail to account for the inherent temporal and structural variations present in actual communication networks. An analysis of real-world temporal networks confirms that these inhomogeneities typically lead to a dramatic slowdown in the diffusion process, and consequently, in the overall convergence of the federated learning system.

Why it matters

Professionals deploying or researching decentralized federated learning need to understand that real-world network complexities can significantly impact model convergence, requiring more robust design and evaluation strategies.

How to implement this in your domain

  1. 1Design DFL experiments to explicitly account for temporal and structural network heterogeneities.
  2. 2Evaluate DFL algorithms using real-world network traces or more realistic synthetic network models.
  3. 3Develop new aggregation strategies that are robust to varying communication patterns and node availability.
  4. 4Consider the trade-offs between communication efficiency and convergence speed in heterogeneous environments.

Who benefits

TelecommunicationsEdge ComputingIoTHealthcare

Key takeaways

  • Decentralized federated learning dynamics resemble lazy random-walk diffusion on temporal networks.
  • Real-world network heterogeneities significantly slow down DFL convergence.
  • Ignoring temporal and structural inhomogeneities leads to overoptimistic convergence estimates.
  • Future DFL designs must account for realistic network conditions to ensure practical viability.

Original post by Arash Badie-Modiri, Chiara Boldrini, Lorenzo Valerio, J\'anos Kert\'esz, M\'arton Karsai

"arXiv:2607.03171v1 Announce Type: new Abstract: Decentralised federated learning, based on peer-to-peer communication, is increasingly proposed for on-device training of machine learning models, promising a privacy-preserving, communication-efficient training process with no risk…"

View on X

Originally posted by Arash Badie-Modiri, Chiara Boldrini, Lorenzo Valerio, J\'anos Kert\'esz, M\'arton Karsai on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses