文献类型：期刊文献

英文题名：Personalized federated learning: A Clustered Distributed Co-Meta-Learning approach

作者：Ren, Maoye[3];Wang, Zhe[1,2];Yu, Xinhai[3]

机构：[1]Minist Educ, Key Lab Smart Mfg Energy Chem Proc, Shanghai, Peoples R China;[2]East China Univ Sci & Technol, Dept Comp Sci & Engn, Shanghai 200237, Peoples R China;[3]East China Univ Sci & Technol, Dept Mech & Power Engn, Shanghai 200237, Peoples R China

年份：2023

卷号：647

外文期刊名：INFORMATION SCIENCES

收录：;EI(收录号：20233414614146);WOS:【SCI-EXPANDED(收录号:WOS:001066375000001)】；

基金：This work is supported by Shanghai Science and Technology Program "Distributed and generative few-shot algorithm and theory research" under Grant No. 20511100600, Shanghai Science and Technology Program "Federated based cross-domain and cross-task incremental learning" under Grant No. 21511100800, Natural Science Foundation of China under Grant No. 62076094.

语种：英文

外文关键词：Federated learning; Distributed Co-Meta-Learning; Personalized federated learning; Efficient and effective; Few-shot learning

摘要：Federated Learning (FL) aims to train a model across multiple parties while preserving the privacy of users' data. Traditional FL only develops a common model for users, and does not adapt the model to each user. Therefore, personalized FL approaches emerged that can further adapt the model to users, thus showing better performance. Among these personalized FL methods, meta-learned personalized FL methods achieve the advanced performance. However, this personalization scheme adapts model to each user according to their own data, and the features it learned are not enough and not rich, especially when there are extremely little data in some users. In this paper, we study a more effective variant of personalization federated learning. We first formalize a new learning problem and propose a Distributed Co-Meta-Learning approach for this learning problem. Then, we show how to design a new personalized FL framework based on this Distributed Co-Meta-Learning approach. To optimize our proposed personalized FL framework, while reducing the computational cost in the optimization, we study a chainestimation aggregation method for our framework. It also reduces the computational load in the clients. Further, we give the theoretical convergence analysis of our method on the most complex case, non-convex and non-IID problems, and analyze some parameters' properties within it. Experiments demonstrate that our method achieves the state-of-the-art performance in the personalization FL area.