论文标题
预算的在线选择候选物联网客户以参与联邦学习
Budgeted Online Selection of Candidate IoT Clients to Participate in Federated Learning
论文作者
论文摘要
尤其是机器学习(ML)和深度学习(DL),在为行业提供智能服务方面起着至关重要的作用。但是,这些技术遭受了隐私和安全问题的困扰,因为数据是从客户那里收集的,然后在中心位置存储和处理。联合学习(FL)是一种模型参数而不是客户数据的体系结构,以解决这些问题的解决方案。然而,FL通过通过通信回合与客户沟通来训练全球模型,这引入了网络上的更多流量,并增加了收敛时间到目标准确性。在这项工作中,我们通过在测试准确性方面选择最佳候选客户来参与培训过程,从而解决了使用预算数量的候选客户来优化状态FL的准确性的问题。接下来,我们提出一个在线状态的fl启发式,以找到最好的候选人客户。此外,我们提出了一个IoT客户端警报应用程序,该应用程序利用了拟议的启发式措施来培训基于IoT设备类型分类的状态FL全球模型,以提醒客户在其环境中未经授权的IoT设备。为了测试所提出的在线启发式方法的效率,我们使用真实数据集进行了多项实验,并将结果与最新算法进行比较。我们的结果表明,所提出的启发式优于在线随机算法,准确性高达27%。此外,提议的在线启发式的性能与最佳离线算法的性能相当。
Machine Learning (ML), and Deep Learning (DL) in particular, play a vital role in providing smart services to the industry. These techniques however suffer from privacy and security concerns since data is collected from clients and then stored and processed at a central location. Federated Learning (FL), an architecture in which model parameters are exchanged instead of client data, has been proposed as a solution to these concerns. Nevertheless, FL trains a global model by communicating with clients over communication rounds, which introduces more traffic on the network and increases the convergence time to the target accuracy. In this work, we solve the problem of optimizing accuracy in stateful FL with a budgeted number of candidate clients by selecting the best candidate clients in terms of test accuracy to participate in the training process. Next, we propose an online stateful FL heuristic to find the best candidate clients. Additionally, we propose an IoT client alarm application that utilizes the proposed heuristic in training a stateful FL global model based on IoT device type classification to alert clients about unauthorized IoT devices in their environment. To test the efficiency of the proposed online heuristic, we conduct several experiments using a real dataset and compare the results against state-of-the-art algorithms. Our results indicate that the proposed heuristic outperforms the online random algorithm with up to 27% gain in accuracy. Additionally, the performance of the proposed online heuristic is comparable to the performance of the best offline algorithm.