MingledPie: A Cluster Mingling Approach for Mitigating Preference Profiling in CFL
Cheng Zhang, Yang Xu, Jianghao Tan, Jiajie An, Wenqiang Jin
Abstract
—Clustered federated learning (CFL) serves as a promising framework to address the challenges of non-IID (non-Independent and Identically Distributed) data and heterogeneity in federated learning. It involves grouping clients into clusters based on the similarity of their data distributions or model updates. However, classic CFL frameworks pose severe threats to clients’ privacy since the honest-but-curious server can easily know the bias of clients’ data distributions (its preferences). In this work, we propose a privacy-enhanced clustered federated learning framework, MingledPie, aiming to resist against servers’ preference profiling capabilities by allowing clients to be grouped into multiple clusters spontaneously. Specifically, within a given cluster, we mingled two types of clients in which a major type of clients share similar data distributions while a small portion of them do not (false positive clients). Such that, the CFL server fails to link clients’ data preferences based on their belonged cluster categories. To achieve this, we design an indistinguishable cluster identity generation approach to enable clients to form clusters with a certain proportion of false positive members without the assistance of a CFL server. Meanwhile, training with mingled false positive clients will inevitably degrade the performances of the cluster’s global model. To rebuild an accurate cluster model, we represent the mingled cluster models as a system of linear equations consisting of the accurate models and solve it. Rigid theoretical analyses are conducted to evaluate the usability and security of the proposed designs. In addition, extensive evaluations of MingledPie on six open-sourced datasets show that it defends against preference profiling attacks with an accuracy of 69.4% on average. Besides, the model accuracy loss is limited to between 0.02% and 3.00%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 43bf72d4-e0e7-485d-adf5-8d800ac3c045Cited by top-tier papers1
Ask how each one uses itBuilds on23
- Membership Inference Attacks Against Machine Learning ModelsReza Shokri, Marco Stronati, Congzheng Song, Vitaly ShmatikovS&P 2017 · 5,137 citations
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi et al.ICML 2020 · 3,875 citations
- On the Convergence of FedAvg on Non-IID DataXiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang et al.ICLR 2020 · 2,930 citations
- An Efficient Framework for Clustered Federated LearningAvishek Ghosh, Jichan Chung, Dong Yin, Kannan RamchandranNeurIPS 2020 · 1,329 citations
- Federated Learning on Non-IID Data Silos: An Experimental StudyQinbin Li, Yiqun Diao, Quan Chen, Bingsheng HeICDE 2022 · 1,110 citations
Related papers
- FedCE: Personalized Federated Learning Method based on Clustering EnsemblesLuxin Cai, Naiyue Chen, Yuanzhouhan Cao, Jiahuan He et al.ACM MM 2023 · 27 citations
- Enhancing Clustered Federated Learning: Integration of Strategies and Improved MethodologiesYongxin Guo, Xiaoying Tang, Tao LinICLR 2025
- Clustered Federated Learning via Gradient-based PartitioningHeasung Kim, Hyeji Kim, Gustavo de VecianaICML 2024 · 18 citations
- Structured Federated Learning through Clustered Additive ModelingJie Ma, Tianyi Zhou, Guodong Long, Jing Jiang et al.NeurIPS 2023 · 28 citations
- Practical Poisoning Attacks with Limited Byzantine Clients in Clustered Federated LearningViet Vo, Mengyao Ma, Guangdong Bai, Ryan K. L. Ko et al.S&P 2025
