mlsanityData to 14 Oct 2026

OmniFC: Rethinking Federated Clustering via Lossless and Secure Distance Reconstruction

arXiv 2505.13071 ↗First posted 19 May 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated clustering (FC) aims to discover global cluster structures across decentralized clients without sharing raw data, making privacy preservation a fundamental requirement. There are two critical challenges: (1) privacy leakage during collaboration, and (2) robustness degradation due to aggregation of proxy information from non-independent and identically distributed (Non-IID) local data, leading to inaccurate or inconsistent global clustering. Existing solutions typically rely on model-specific local proxies, which are sensitive to data heterogeneity and inherit inductive biases from their centralized counterparts, thus limiting robustness and generality. We propose Omni Federated Clustering (OmniFC), a unified and model-agnostic framework. Leveraging Lagrange coded computing, our method enables clients to share only encoded data, allowing exact reconstruction of the global distance matrix--a fundamental representation of sample relationships--without leaking private information, even under client collusion. This construction is naturally resilient to Non-IID data distributions. This approach decouples FC from model-specific proxies, providing a unified extension mechanism applicable to diverse centralized clustering methods. Theoretical analysis confirms both reconstruction fidelity and privacy guarantees, while comprehensive experiments demonstrate OmniFC's superior robustness, effectiveness, and generality across various benchmarks compared to state-of-the-art methods. Code will be released.

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

Builds on

19 of 52 references.

References · 19

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  2. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
  3. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  4. 2021DENSE: Data-Free One-Shot Federated Learningcited by 100
  5. 2021Heterogeneity for the Win: One-Shot Federated Clusteringcited by 87
  6. 2022A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directionscited by 73
  7. 2018Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacycited by 66
  8. 2022Towards Federated Clustering: A Federated Fuzzy c-Means Algorithm (FFCM)cited by 30
  9. 2022Machine Unlearning of Federated Clusterscited by 22
  10. 2022DReS-FL: Dropout-Resilient Secure Federated Learning for Non-IID Clients via Secret Data Sharingcited by 17
  11. 2018Evaluation of Community Detection Methodscited by 14
  12. 2022Secure Federated Clusteringcited by 10
7 more
  1. 2022Privacy-Preserving Federated Deep Clustering based on GANcited by 5
  2. 2024CCFC: Bridging Federated Clustering and Contrastive Learningcited by 4
  3. 2024Breaking the Reclustering Barrier in Centroid-based Deep Clusteringcited by 4
  4. 2024CCFC++: Enhancing Federated Clustering through Feature Decorrelationcited by 3
  5. 2024FastLloyd: Federated, Accurate, Secure, and Tunable k-Means Clustering with Differential Privacycited by 2
  6. 2024On the cohesion and separability of average-link for hierarchical agglomerative clusteringcited by 2
  7. 2024Jigsaw Game: Federated Clusteringcited by 1

Built on by

Not cited yet.