arXiv Machine Learning
Federated Clustering with Unknown Local and Global Cluster Cardinalities
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Statistics ML
6d ago
Ensembles of Exactly Solved Subsamples for Clusterwise Regression: Trimming Without a Trimming Level
The paper proposes an ensemble method for clusterwise regression that uses exact solutions on many small random subsamples. Each subsample is solved to global optimality, extended to the full data via nearest-surface assignment, and the resulting partitions are combined by voting or selection. The method achieves high accuracy even with up to 20% gross outliers and can estimate the trimming level without prior knowledge, outperforming traditional trimmed alternation in worst‑case scenarios.
arXiv Machine Learning
Jul 3
Statistical Properties of $k$-means Clustering for Data Missing Completely at Random
arXiv:2607. 01945v1 Announce Type: cross Abstract: The classical $k$-means clustering cannot be directly used to incomplete data, and existing $k$-means-based clustering for missing data primarily focus on improving the practical accuracy of clustering, whereas most of them lack theoretical guarantees in the asymptotic sense.
arXiv Machine Learning
Jun 19
Variational Consensus Monte Carlo for Bayesian Mixture
arXiv:2606. 19643v1 Announce Type: cross Abstract: Motivated by the privacy, sensitivity and sharing limitations of health data, we present a comprehensive pipeline for inference of Bayesian mixture models within a federated learning setting, i.
arXiv Machine Learning
Sep 17
Bracketing Uncertainty in Clustering Under the Manifold Hypothesis
The paper formalizes a geometric tradeoff between ambient separation and sampling gaps to determine when distinct manifold components can be reliably separated in clustering. It introduces a threshold phenomenon for mutual‑k‑nearest‑neighbor graphs, defining an uncertainty zone where the number of clusters cannot be identified. The authors propose Manifold‑Based Clustering (MBC), which outputs a bracket interval quantifying this uncertainty rather than forcing a single cluster count.
arXiv Machine Learning
Sep 7
Explainable Clustering of Mixture Models
arXiv:2411. 01576v3 Announce Type: replace Abstract: The explainable clustering problem was first posed by Moshkovitz et al.
arXiv AI
Jun 16
CLoVE: Personalized Federated Learning through Clustering of Loss Vector Embeddings
arXiv:2506. 22427v2 Announce Type: replace-cross Abstract: We propose CLoVE (Clustering of Loss Vector Embeddings), a novel algorithm for Clustered Federated Learning (CFL).