Incentive Mechanism Design for Federated Learning and Unlearning

被引:4
作者
Ding, Ningning [1 ]
Sun, Zhenyu [1 ]
Wei, Ermin [1 ]
Berry, Randall [1 ]
机构
[1] Northwestern Univ, Evanston, IL 60201 USA
来源
PROCEEDINGS OF THE 2023 INTERNATIONAL SYMPOSIUM ON THEORY, ALGORITHMIC FOUNDATIONS, AND PROTOCOL DESIGN FOR MOBILE NETWORKS AND MOBILE COMPUTING, MOBIHOC 2023 | 2023年
基金
美国国家科学基金会;
关键词
incentive mechanism; federated learning; federated unlearning; PRIVACY;
D O I
10.1145/3565287.3610269
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To protect users' right to be forgotten in federated learning, federated unlearning aims at eliminating the impact of leaving users' data on the global learned model. The current research in federated unlearning mainly concentrated on developing effective and efficient unlearning techniques. However, the issue of incentivizing valuable users to remain engaged and preventing their data from being unlearned is still under-explored, yet important to the unlearned model performance. This paper focuses on the incentive issue and develops an incentive mechanism for federated learning and unlearning. We first characterize the leaving users' impact on the global model accuracy and the required communication rounds for unlearning. Building on these results, we propose a four-stage game to capture the interaction and information updates during the learning and unlearning process. A key contribution is to summarize users' multi-dimensional private information into one-dimensional metrics to guide the incentive design. We show that users who incur high costs and experience significant training losses are more likely to discontinue their engagement through federated unlearning. The server tends to retain users who make substantial contributions to the model but has a trade-off on users' training losses, as large training losses of retained users increase privacy costs but decrease unlearning costs. The numerical results demonstrate the necessity of unlearning incentives for retaining valuable leaving users, and also show that our proposed mechanisms decrease the server's cost by up to 53.91% compared to state-of-the-art benchmarks.
引用
收藏
页码:11 / 20
页数:10
相关论文
共 29 条
  • [1] Bourtoule L., 2021, 2021 IEEE S SEC PRIV
  • [2] Towards Making Systems Forget with Machine Unlearning
    Cao, Yinzhi
    Yang, Junfeng
    [J]. 2015 IEEE SYMPOSIUM ON SECURITY AND PRIVACY SP 2015, 2015, : 463 - 480
  • [3] Unique in the Crowd: The privacy bounds of human mobility
    de Montjoye, Yves-Alexandre
    Hidalgo, Cesar A.
    Verleysen, Michel
    Blondel, Vincent D.
    [J]. SCIENTIFIC REPORTS, 2013, 3
  • [4] Optimal Contract Design for Efficient Federated Learning With Multi-Dimensional Private Information
    Ding, Ningning
    Fang, Zhixuan
    Huang, Jianwei
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (01) : 186 - 200
  • [5] Ding Ningning, 2023, Techinical Report
  • [6] Gao XS, 2022, Arxiv, DOI arXiv:2205.12709
  • [7] Harding E. L., 2019, J. Data Protection Privacy, V2, P234
  • [8] Hong Xie, 2014, ACM SIGMETRICS Performance Evaluation Review, V42, P52
  • [9] Jiang YH, 2023, Arxiv, DOI arXiv:1909.12488
  • [10] Karimireddy SP, 2020, PR MACH LEARN RES, V119