MingledPie: A Cluster Mingling Approach for Mitigating Preference Profiling in CFL
Cheng Zhang, Yang Xu, Jianghao Tan, Jiajie An, Wenqiang Jin
摘要
—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%.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper23
- Membership Inference Attacks Against Machine Learning ModelsReza Shokri, Marco Stronati, Congzheng Song, Vitaly ShmatikovS&P 2017 · 被引用 5,137 次
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi 等ICML 2020 · 被引用 3,875 次
- On the Convergence of FedAvg on Non-IID DataXiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang 等ICLR 2020 · 被引用 2,930 次
- An Efficient Framework for Clustered Federated LearningAvishek Ghosh, Jichan Chung, Dong Yin, Kannan RamchandranNeurIPS 2020 · 被引用 1,329 次
- Federated Learning on Non-IID Data Silos: An Experimental StudyQinbin Li, Yiqun Diao, Quan Chen, Bingsheng HeICDE 2022 · 被引用 1,110 次
相关 Paper
- FedCE: Personalized Federated Learning Method based on Clustering EnsemblesLuxin Cai, Naiyue Chen, Yuanzhouhan Cao, Jiahuan He 等ACM MM 2023 · 被引用 27 次
- 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 次
- Structured Federated Learning through Clustered Additive ModelingJie Ma, Tianyi Zhou, Guodong Long, Jing Jiang 等NeurIPS 2023 · 被引用 28 次
- Practical Poisoning Attacks with Limited Byzantine Clients in Clustered Federated LearningViet Vo, Mengyao Ma, Guangdong Bai, Ryan K. L. Ko 等S&P 2025
