Asynchronous Federated Clustering with Unknown Number of Clusters
Yunfan Zhang, Yiqun Zhang, Yang Lu, Mengke Li, Xi Chen, Yiu-ming Cheung
Abstract
Federated Clustering (FC) is crucial to mining knowledge from unlabeled non-Independent Identically Distributed (non-IID) data provided by multiple clients while preserving their privacy. Most existing attempts learn cluster distributions at local clients, then securely pass the desensitized information to the server for aggregation. However, some tricky but common FC problems are still relatively unexplored, including the heterogeneity in terms of clients' communication capacity and the unknown number of proper clusters. To further bridge the gap between FC and real application scenarios, this paper first shows that the clients' communication asynchrony and unknown proper cluster numbers are complex coupling problems, and then proposes an Asynchronous Federated Cluster Learning (AFCL) method accordingly. It spreads the excessive number of seed points to clients as a learning medium and coordinates them across clients to form a consensus. To alleviate the distribution imbalance cumulated due to the unforeseen asynchronous uploading from the heterogeneous clients, we also design a balancing mechanism for seeds updating. As a result, the seeds gradually adapt to each other to reveal a proper number of clusters. Extensive experiments demonstrate the efficacy of AFCL.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5a71fde3-7fb2-4edd-bfb4-5d6e8609e87aCited by top-tier papers3
- A Federated Generalized Expectation-Maximization Algorithm for Mixture Models with an Unknown Number of ComponentsMichael Ibrahim, Nagi Gebraeel, Weijun XieICLR 2026 · 1 citation
- Differentially Private Federated k-Means Clustering with Server-Side DataJonathan Scott, Christoph H. Lampert, David SaulpicICML 2025
- Parameter-Free Clustering via Self-Supervised Consensus MaximizationLijun Zhang, Suyuan Liu, Siwei Wang, Shengju Yu et al.AAAI 2026
Builds on7
- An Efficient Framework for Clustered Federated LearningAvishek Ghosh, Jichan Chung, Dong Yin, Kannan RamchandranNeurIPS 2020 · 1,329 citations
- Heterogeneity for the Win: One-Shot Federated ClusteringDon Kurian Dennis, Tian Li, Virginia SmithICML 2021 · 212 citations
- Unsupervised Graph Association for Person Re-IdentificationJinlin Wu, Hao Liu, Yang Yang, Zhen Lei et al.ICCV 2019 · 116 citations
- Federated Spectral Clustering via Secure Similarity ReconstructionDong Qiao, Chris Ding, Jicong FanNeurIPS 2023 · 33 citations
- Coresets for Vertical Federated Learning: Regularized Linear Regression and -Means ClusteringLingxiao Huang, Zhize Li, Jialin Sun, Haoyu ZhaoNeurIPS 2022 · 31 citations
Related papers
- FedCND: Federated Graph-Level Clustering under Inter-Client Cluster Number DiscrepancyJunlong Wu, Renda Han, Wenxuan Tu, Jingxin Liu et al.WWW 2026
- FedCE: Personalized Federated Learning Method based on Clustering EnsemblesLuxin Cai, Naiyue Chen, Yuanzhouhan Cao, Jiahuan He et al.ACM MM 2023 · 27 citations
- Federated Deep Multi-View Clustering with Global Self-SupervisionXinyue Chen, Jie Xu, Yazhou Ren, Xiaorong Pu et al.ACM MM 2023 · 21 citations
- OmniFC: Rethinking Federated Clustering via Lossless and Secure Distance ReconstructionJie Yan, Jing Liu, Zhong-Yuan ZhangNeurIPS 2025
- Generalizable Heterogeneity-aware Federated Feature and Basic-matrix Consistency LearningXuan Lai, Luying Zhong, Tianying Lu, Junjie Zhang et al.AAAI 2026
