arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.03788cs.LG

联邦学习中的动态聚类

Dynamic Clustering in Federated Learning

KTH Royal Institute of Technology(瑞典皇家理工学院);Ericsson Research(爱立信研究院)

Yeongwoo Kim, Ezeddin Al Hakim, Johan Haraldson, Henrik Eriksson, José Mairton B. da Silva, Carlo Fischione

AI总结:

针对联邦学习中切换预测受非独立同分布数据影响、传统聚类存在隐私与适应性问题,提出三阶段动态聚类算法,在时间序列预测任务中使蜂窝网络切换等预测模型性能提升43%。

摘要:

在无线网络的资源管理中,联邦学习已被用于预测切换。然而,非独立同分布数据会降低此类预测的准确率性能。为解决该问题,联邦学习可利用数据聚类算法,为每个聚类构建一个机器学习模型。但传统数据聚类算法应用于切换预测时存在三大主要局限:数据隐私泄露风险、聚类形状固定、聚类数量无法自适应调整。为克服这些局限,本文提出一种三阶段数据聚类算法,即:基于生成对抗网络的聚类、聚类校准、聚类划分。我们证明,基于生成对抗网络的聚类可保护隐私。聚类校准通过调整聚类应对动态环境。此外,分裂式聚类通过反复选择一个聚类并将其划分为多个聚类,探索不同的聚类数量。我们在一个时间序列预测任务上测试了基线算法与本文算法,结果表明,本文算法将包括蜂窝网络切换在内的预测模型性能提升了43%。

英文摘要:

In the resource management of wireless networks, Federated Learning has been used to predict handovers. However, non-independent and identically distributed data degrade the accuracy performance of such predictions. To overcome the problem, Federated Learning can leverage data clustering algorithms and build a machine learning model for each cluster. However, traditional data clustering algorithms, when applied to the handover prediction, exhibit three main limitations: the risk of data privacy breach, the fixed shape of clusters, and the non-adaptive number of clusters. To overcome these limitations, in this paper, we propose a three-phased data clustering algorithm, namely: generative adversarial network-based clustering, cluster calibration, and cluster division. We show that the generative adversarial network-based clustering preserves privacy. The cluster calibration deals with dynamic environments by modifying clusters. Moreover, the divisive clustering explores the different number of clusters by repeatedly selecting and dividing a cluster into multiple clusters. A baseline algorithm and our algorithm are tested on a time series forecasting task. We show that our algorithm improves the performance of forecasting models, including cellular network handover, by 43%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑