Towards Fast and Accurate Federated Learning with Non-IID Data for Cloud-Based IoT Applications

Tian Liu, Jiahao Ding, Ting Wang, Miao Pan, Mingsong Chen

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

As a promising method of central model training on decentralized device data while securing user privacy, Federated Learning (FL) is becoming popular in the Internet of Things (IoT) design. However, when the data collected by IoT devices are highly skewed in a non-independent and identically distributed (non-IID) manner, the accuracy of the vanilla FL method cannot be guaranteed. Although there exist various solutions that try to address the bottleneck of FL with non-IID data, most of them suffer from extra intolerable communication overhead and low model accuracy. To enable fast and accurate FL, this paper proposes a novel data-based device grouping approach that can effectively reduce the disadvantages of weight divergence during the training of non-IID data. However, since our grouping method is based on the similarity of extracted feature maps from IoT devices, it may incur additional risks of privacy exposure. To solve this problem, we propose an improved version by exploiting similarity information using the Locality-Sensitive Hashing (LSH) algorithm without exposing extracted feature maps. Comprehensive experimental results on well-known benchmarks show that our approach can not only accelerate the convergence rate, but also improve the prediction accuracy for FL with non-IID data.

Original languageEnglish
Article number2250235
JournalJournal of Circuits, Systems and Computers
Volume31
Issue number13
DOIs
StatePublished - 15 Sep 2022

Keywords

  • Data-based device grouping
  • Federated Learning (FL)
  • Internet of Things (IoT)
  • Locality-Sensitive Hashing (LSH)
  • non-IID

Fingerprint

Dive into the research topics of 'Towards Fast and Accurate Federated Learning with Non-IID Data for Cloud-Based IoT Applications'. Together they form a unique fingerprint.

Cite this