arXiv:2512.22897cs.LGcs.MM2025-12

提出联邦多任务聚类框架,实现隐私保护下的个性化聚类与共享结构学习。

Federated Multi-Task Clustering

  • 客户端学习个性化聚类模型,支持无伪标签的泛化推理
  • 服务器端通过张量低秩正则发现客户间共享子空间,提升整体性能
  • 适用于数据异构、注重隐私的分布式聚类场景

谱聚类因其优异性能成为最有效的聚类算法之一,但现有方法多针对集中式环境,难以适应现代去中心化场景。当前联邦学习方法常因依赖不可靠伪标签导致泛化性能差,且无法捕捉异构客户端间的潜在关联。为此,本文提出新型联邦多任务聚类框架(FMTC),在保护隐私的前提下,为异构客户端学习个性化聚类模型,并协同利用其共享底层结构。FMTC包含两个核心组件:客户端侧的个性化聚类模块,通过参数化映射模型支持鲁棒的样本外推理,无需依赖伪标签;服务器侧的张量相关性模块,将所有客户端模型组织成统一张量,采用低秩正则化以发现共同子空间。为求解该联合优化问题,设计了一种基于交替方向乘子法的高效隐私保护分布式算法,将全局问题分解为客户端并行更新与服务器聚合步骤。多个真实数据集上的大量实验表明,所提FMTC框架显著优于各类基线与先进联邦聚类算法。

原文摘要 · Abstract (English)

Spectral clustering has emerged as one of the most effective clustering algorithms due to its superior performance. However, most existing models are designed for centralized settings, rendering them inapplicable in modern decentralized environments. Moreover, current federated learning approaches often suffer from poor generalization performance due to reliance on unreliable pseudo-labels, and fail to capture the latent correlations amongst heterogeneous clients. To tackle these limitations, this paper proposes a novel framework named Federated Multi-Task Clustering (i.e.,FMTC), which intends to learn personalized clustering models for heterogeneous clients while collaboratively leveraging their shared underlying structure in a privacy-preserving manner. More specifically, the FMTC framework is composed of two main components: client-side personalized clustering module, which learns a parameterized mapping model to support robust out-of-sample inference, bypassing the need for unreliable pseudo-labels; and server-side tensorial correlation module, which explicitly captures the shared knowledge across all clients. This is achieved by organizing all client models into a unified tensor and applying a low-rank regularization to discover their common subspace. To solve this joint optimization problem, we derive an efficient, privacy-preserving distributed algorithm based on the Alternating Direction Method of Multipliers, which decomposes the global problem into parallel local updates on clients and an aggregation step on the server. To the end, several extensive experiments on multiple real-world datasets demonstrate that our proposed FMTC framework significantly outperforms various baseline and state-of-the-art federated clustering algorithms.

联邦学习聚类多任务隐私保护

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。