mlsanityData to 14 Oct 2026

Federated Clustering with Unknown Local and Global Cluster Cardinalities

arXiv 2609.36762 ↗First posted 29 Sep 2026cs.LG cs.DC stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated clustering methods that do not require the global number of clusters K still assume that each client knows its local number Kg. This assumption is hard to justify when clients know no more about their data than the server does, as in fault diagnosis across independently operated industrial sites. We propose a two-phase framework in which neither count is known: each client first estimates Kg from its own data, and an aggregator that requires local counts, such as FedGEM, then uses these estimates in place of the true values. For the first phase we introduce Adaptive Split--Merge (ASM), which grows a spherical Gaussian mixture by BIC-driven splitting and then merges excess components. ASM uses no labels, selects its hyperparameters on held-out client data only, and makes no assumption about how clusters are shared across clients. We derive a closed-form split criterion whose critical cluster size falls with anisotropy and rises with dimension, and show empirically that over-fragmentation grows with the number of points per cluster, which federation divides among clients. Across eight datasets, ASM with FedGEM attains a mean ARI of 0.333, against 0.256 for the next best label-free estimator and 0.361 when the true local counts are supplied. It also gives the most reliable global estimates of K and is robust when client size is decoupled from local cardinality.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

8 of 19 references.

References · 8

  1. 2020An Efficient Framework for Clustered Federated Learningcited by 511
  2. 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 503
  3. 2021Heterogeneity for the Win: One-Shot Federated Clusteringcited by 87
  4. 2022Towards Federated Clustering: A Federated Fuzzy c-Means Algorithm (FFCM)cited by 30
  5. 2019Statistical Model Aggregation via Parameter Matchingcited by 17
  6. 2024Asynchronous Federated Clustering with Unknown Number of Clusterscited by 11
  7. 2023Federated K-means Clusteringcited by 9
  8. 2026A Federated Generalized Expectation-Maximization Algorithm for Mixture Models with an Unknown Number of Componentscited by 1

Built on by

Not cited yet.