Client-Lightweight Soft Clustering Federated Learning

Authors

  • XinJie Liu Qingdao University, Qingdao 266071, China Author
  • DingKai Hu Qingdao University, Qingdao 266071, China Author

DOI:

https://doi.org/10.63313/JCSFT.9045

Keywords:

Federated Learning, Soft Clustering, Private Set Intersection

Abstract

Clustered federated learning is a highly effective approach to addressing the non-independent and identically distributed (Non-IID) problem in conventional federated learning. Soft clustering federated learning allows clients to belong to multiple clusters, which not only captures the common characteristics of clients within the same cluster but also fully adapts to the unique properties of each client’s local data. This significantly improves model personalization and generalization ability, and greatly enhances model performance and training efficiency in Non-IID scenarios. Recent advanced soft clustering federated learning methods no longer rely on client model parameters for clustering. Instead, they generate asymmetric similarities via privacy-preserving set intersection operations on clients’ local datasets, which are then sent to the server for clustering. This avoids the privacy risks associated with uploading model parameters from clients. In this work, we optimize this clustering paradigm by adopting locality-sensitive hashing and an improved privacy-preserving set intersection scheme. Our method substantially reduces the communication and computational overhead among clients while maintaining competitive model performance.

References

[1] F. Sattler, K.-R. Müller, W. Samek, Clustered federated learning: Model-agnostic distributed multitask optimization under privacy constraints, IEEE transactions on neural networks and learning systems 32 (8) (2020) 3710–3722.

[2] Y. Xu et al., "Towards Privacy-Enhanced and Robust Clustered Federated Learning," in IEEE Transactions on Mobile Computing, vol. 24, no. 8, pp. 7171-7188, Aug. 2025, doi: 10.1109/TMC.2025.3547149.

[3] Á. Kiss, J. Liu, T. Schneider, N. Asokan, and B. Pinkas, “Private set intersection for unequal set sizes with mobile applications,” Privacy Enhancing Technol., vol. 2017, no. 4, pp. 177–197, 2017.

[4] H. B. McMahan, E. Moore, D. Ramage, S. Hampson, B. A. y Arcas, Communication-efficient learning of deep networks from decentralized data, in: International Conference on Artificial Intelligence and Statistics, 2016.

[5] Y. Zhao, M. Li, L. Lai, N. Suda, D. Civin, V. Chandra, Federated learning with non-iid data (2018). doi:10.48550/ARXIV.1806.00582.

[6] Marfoq, O.; Neglia, G.; Bellet, A.; Kameni, L.; and Vidal, R. 2021. Federated Multi-Task Learning under a Mixture of Distributions. International Workshop on Federated Learning for User Privacy and Data Confidentiality in Conjunction with ICML 2021 (FL-ICML’21).

[7] Y. Ruan and C. Joe Wong, “FedSoft: Soft clustered federated learning with proximal local updating,” in Proc. AAAI Conf. Artif. Intell.2022, pp. 8124-8131.

[8] I-Cheng Lin, Osman Yağan, and Carlee Joe-Wong. 2025. FedSPD: a soft-clustering approach for personalized decentralized federated learning. In Proceedings of the Forty-First Conference on Uncertainty in Artificial Intelligence (UAI '25), Vol. 286. JMLR.org, Article 113, 2618–2641.

[9] Peter Rindal and Phillipp Schoppmann. 2021. VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE. In Advances in Cryptology – EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17–21, 2021, Proceedings, Part II. Springer-Verlag, Berlin, Heidelberg, 901–930. https://doi.org/10.1007/978-3-030-77886-6_31

[10] A. Ghosh, J. Hong, D. Yin, K. Ramchandran, Robust federated learning in a heterogeneous environment, arXiv preprint arXiv:1906.06629(2019).

[11] Y. He, D. Yan, F. Chen, Hierarchical federated learning with local model embedding, Engineering Applications of Artificial Intelligence 123 (2023) 106148.

[12] Z. Ye, X. Zhang, X. Chen, H. Xiong, D. Yu, Adaptive clustering based personalized federated learning framework for next poi recommendation with location noise, IEEE Transactions on Knowledge and Data Engineering 36 (5) (2024) 1843–1856. doi:10.1109/TKDE.2023.3312511.

Downloads

Published

2026-02-28

Issue

Section

Articles

How to Cite

Client-Lightweight Soft Clustering Federated Learning. (2026). Journal of Computer Science and Frontier Technologies, 2(3), 19-26. https://doi.org/10.63313/JCSFT.9045