A Federated Generalized Expectation-Maximization Algorithm for Mixture Models with an Unknown Number of Components
Michael Ibrahim, Nagi Gebraeel, Weijun Xie

TL;DR
This paper introduces FedGEM, a federated EM algorithm for clustering with unknown number of components, providing theoretical guarantees and demonstrating competitive performance against centralized methods.
Contribution
The paper proposes FedGEM, a novel federated EM algorithm capable of estimating the number of mixture components with theoretical convergence guarantees.
Findings
FedGEM achieves performance comparable to centralized EM.
It outperforms existing federated clustering methods.
Theoretical analysis confirms probabilistic convergence under common assumptions.
Abstract
We study the problem of federated clustering when the total number of clusters across clients is unknown, and the clients have heterogeneous but potentially overlapping cluster sets in their local data. To that end, we develop FedGEM: a federated generalized expectation-maximization algorithm for the training of mixture models with an unknown number of components. Our proposed algorithm relies on each of the clients performing EM steps locally, and constructing an uncertainty set around the maximizer associated with each local component. The central server utilizes the uncertainty sets to learn potential cluster overlaps between clients, and infer the global number of clusters via closed-form computations. We perform a thorough theoretical study of our algorithm, presenting probabilistic convergence guarantees under common assumptions. Subsequently, we study the specific setting of…
Peer Reviews
Decision·ICLR 2026 Poster
1. The structure of the paper is relatively clear. 2. The theoretical derivation and proof in the paper are quite thorough.
There are only two compared algorithms that do not assume prior knowledge of K. Among them, one is the algorithm proposed in 1974, and the other is AFCL, which uses entirely different datasets from those in this paper. These two aspects result in flaws in the experimental design, making it difficult to truly reflect the algorithm's performance.
# originality Federated EM with unknown global K via uncertainty-set–based merging at the server is an interesting angle relative to standard federated clustering/EM, and distinct from k-means-style approaches # quality The paper presents local convergence results for the GEM variant, as well as finite-sample versus population map deviation bounds under the stated assumptions. the radius subproblem has a stated unique solution and a low-complexity solver with a convergence and complexity disc
# originality The method is positioned generally ("mixture models with unknown K"), but the analysis and implementation hinge on isotropic Gaussians with fixed weights; this narrows the contribution relative to the stated ambition. Extending to anisotropic covariances or learning pi would be more compelling. # quality weights fixed, covariance fixed to identity, Kg known locally. the paper also does not study the effects of mispecified pi. The overlap-detection step entails pairwise checks o
- Sound Validation: The extensive experimental results demonstrate the effectiveness of the FedGEM. The results in Table 1 show that FedGEM outperforms AFCL, the only other federated baseline that operates without knowing K. Also, FedGEM is competitive with federated methods that are given the true K in advance. The sensitivity study further indicates the robustness of FedGEM, showing strong performance even when theoretical assumptions like well-separated clusters are violated. - Theoretical An
- Generality: The implementation, theoretical verification, and experiments are based on an isotropic GMM. However, its performance on real-world data with arbitrarily shaped clusters might be limited. - Computational Complexity: The server is required to identify cluster overlaps involves pairwise comparisons between all local components from all clients. This is a computational complexity that scales quadratically with the total number of local components across the network. Though the scalabi
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Advanced Clustering Algorithms Research · Privacy-Preserving Technologies in Data
