arXiv Machine Learning

Evolving Federated Density Peak Clustering with Shuffler-Based Anonymization

The paper introduces Evolving Federated Density Peak Clustering (eFDPC), a one‑shot federated clustering method that merges evolving fuzzy data‑stream clustering with density peak clustering. Each client independently updates micro‑clusters from private mini‑batches, and only selected density peaks are sent to the server, reducing communication. A shuffler‑based anonymization layer protects client contributions, and two variants—eFDPC‑P and eFDPC‑G—are evaluated on synthetic and real datasets, outperforming recent federated clustering baselines in one‑shot settings and handling high‑dimensional, non‑IID data.

arXiv Machine Learning
Oct 3

StoCFL: A Stochastically Clustered Federated Learning Framework for Non-IID Data with Dynamic Client Participation

StoCFL is a clustered federated learning framework designed to address Non-IID data and dynamic client participation. It introduces a flexible clustering mechanism that allows arbitrary client participation and accommodates newly joined clients, improving data efficiency and model performance. Experiments on four Non-IID settings and a real-world dataset demonstrate that StoCFL achieves promising cluster results even when the number of clusters is unknown, outperforming baseline approaches across various scenarios.

By Dun Zeng, Xiangjing Hu, Shiyu Liu, Yue Yu, Qifan Wang, Zenglin Xu
arXiv Machine Learning
Oct 5

RIPPLE in Still Water: Zero-Shot Clustering in Federated Learning with Wavelet Scattering Transform

RIPPLE is a clustered federated learning framework that assigns clients to groups based on an offline spectral characterization of their local data. It uses a variance‑weighted principal‑component prototype embedded via the Wavelet Scattering Transform and decoded by a Gaussian Mixture VAE trained on synthetic client populations. The method achieves the same per‑round communication cost as FedAvg, allows absent clients to receive a personalized model with a single forward pass, and demonstrates superior performance across five heterogeneous benchmarks.

By Alessandro Licciardi
arXiv Machine Learning
Oct 7

Fed-BRDECS: Privacy-Preserving and Heterogeneity-Aware Federated Deep Embedded Clustering

Fed-BRDECS is a federated deep embedded clustering framework that protects client privacy by replacing globally normalized clustering objectives with a locally computable sample‑stability loss, eliminating the need to share sensitive soft‑assignment distributions. It addresses non‑IID client data through prediction‑balanced sampling, which oversamples rare predicted clusters, and centroid‑level restarting, which refreshes biased or inactive centroids. Experiments on image, text, and time‑series datasets demonstrate that Fed‑BRDECS outperforms existing federated and deep clustering methods while adding no inference‑time cost for anomaly detection.

By Haemin Park, Diego Klabjan, Martin W. Braun, Xiuqi Li, Balakrishnan Ananthanarayanan
Hugging Face Trending Papers
Aug 10

FedTVD: Balancing Data Quality and Quantity for Robust Federated Learning

Federated Learning (FL) enables collaborative model training across distributed client devices while preserving data privacy. However, FL faces significant challenges due to data heterogeneity, particularly in terms of label distribution skewness and variations in dataset sizes, which can lead to biased model updates and hinder convergence.