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

网络上的联邦k均值

Federated k-Means over Networks

Aalto University(阿尔托大学)

Xu Yang, Salvatore Rastelli, Alexander Jung

AI总结:

本文提出了一种基于广义总变分最小化的联邦k均值算法,通过正则化k均值问题实现设备间聚类质心的一致性更新,保障隐私安全。

摘要:

我们研究了联邦聚类,其中互联设备协同聚类私有本地数据集的数据点。聚焦于通过k均值原理实现的硬聚类,我们将联邦k均值制定为广义总变分最小化(GTVMin)的一个实例。这导致了一种联邦k均值算法,其中每个设备通过求解带有正则化k均值问题的正则化k均值问题来更新其本地聚类质心,正则化项强制相邻设备之间的一致性。所得到的算法具有隐私保护性,因为仅交换聚合信息。

英文摘要:

We study federated clustering, where interconnected devices collaboratively cluster the data points of private local datasets. Focusing on hard clustering via the k-means principle, we formulate federated k-means as an instance of generalized total variation minimization (GTVMin). This leads to a federated k-means algorithm in which each device updates its local cluster centroids by solving a regularized k-means problem with a regularizer that enforces consistency between neighbouring devices. The resulting algorithm is privacy-friendly, as only aggregated information is exchanged.

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

↑