Privacy-Enhanced Decentralized Federated Learning at Dynamic Edge

Abstract

Decentralized Federated Learning (DeFL) plays a critical role in improving effectiveness of training and has been proved to give great scope to the development of edge computing. However, on the one hand, inaccessibility of private data and excessively exploiting the data throughout the learning process have become a public concern, and on the other hand the connections between server-less edge devices are always varying due to the mobility of edge intelligent devices. To address the above issues, we propose a <u>P</u> rivacy- <u>E</u> nhanced - <u>D</u> ynamic - <u>D</u> ecentralized - <u>F</u> ederated - <u>L</u> earning algorithm called PED <inline-formula><tex-math notation="LaTeX">$ ^{2}$</tex-math></inline-formula> FL in a dynamic edge environment. We design the PED <inline-formula><tex-math notation="LaTeX">$ ^{2}$</tex-math></inline-formula> FL under the analog transmission scheme, where mobile edge devices transmit privacy preserving data simultaneously and accomplish efficient information aggregation with doubly-stochastic adjacent matrices. With thorough analysis, it can be demonstrated that PED <inline-formula><tex-math notation="LaTeX">$ ^{2}$</tex-math></inline-formula> FL satisfies <inline-formula><tex-math notation="LaTeX">$(\epsilon,\delta)$</tex-math></inline-formula> -differential privacy while the per-device privacy budget decays exponentially with the number of the neighbors, which greatly improved the data utility compared to the fixed budget in the orthogonal transmission strategy. PED <inline-formula><tex-math notation="LaTeX">$ ^{2}$</tex-math></inline-formula> FL has the same convergence rate <inline-formula><tex-math notation="LaTeX">$\mathcal {O}(\sqrt{\frac{1}{KN}})$</tex-math></inline-formula> as the non-private decentralized learning algorithm D-PSGD without enhanced privacy protection, where <inline-formula><tex-math notation="LaTeX">$K$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula> are the total iterations and the number of nodes, respectively. Extensive experiments show that algorithm PED <inline-formula><tex-math notation="LaTeX">$ ^{2}$</tex-math></inline-formula> FL also performs well with real-world settings.