计算机科学
联合学习
个性化
联营
人口
原始数据
块(置换群论)
梯度下降
数据挖掘
解耦(概率)
人工智能
信息隐私
趋同(经济学)
数据科学
最优化问题
数据集成
机器学习
数据建模
个性化医疗
分布式数据库
可用性
作者
Hao Di,Yi Yang,Haishan Ye,Xiangyu Chang
标识
DOI:10.48550/arxiv.2310.14337
摘要
Personalization aims to characterize individual preferences and is widely applied across many fields. However, conventional personalized methods operate in a centralized manner, potentially exposing raw data when pooling individual information. In this paper, with privacy considerations, we develop a flexible and interpretable personalized framework within the paradigm of federated learning, called \texttt{PPFL} (Population Personalized Federated Learning). By leveraging ``canonical models" to capture fundamental characteristics of a heterogeneous population and employing ``membership vectors" to reveal clients' preferences, \texttt{PPFL} models heterogeneity as clients' varying preferences for these characteristics. This approach provides substantial insights into client characteristics, which are lacking in existing Personalized Federated Learning (PFL) methods. Furthermore, we explore the relationship between \texttt{PPFL} and three main branches of PFL methods: clustered FL, multi-task PFL, and decoupling PFL, and demonstrate the advantages of \texttt{PPFL}. To solve \texttt{PPFL} (a non-convex optimization problem with linear constraints), we propose a novel random block coordinate descent algorithm and establish its convergence properties. We conduct experiments on both pathological and practical data sets, and the results validate the effectiveness of \texttt{PPFL}.
科研通智能强力驱动
Strongly Powered by AbleSci AI