{"title":"加速公平联合学习:自适应联合亚当","authors":"Li Ju;Tianru Zhang;Salman Toor;Andreas Hellander","doi":"10.1109/TMLCN.2024.3423648","DOIUrl":null,"url":null,"abstract":"Federated learning is a distributed and privacy-preserving approach to train a statistical model collaboratively from decentralized data held by different parties. However, when the datasets are not independent and identically distributed, models trained by naive federated algorithms may be biased towards certain participants, and model performance across participants is non-uniform. This is known as the fairness problem in federated learning. In this paper, we formulate fairness-controlled federated learning as a dynamical multi-objective optimization problem to ensure the fairness and convergence with theoretical guarantee. To solve the problem efficiently, we study the convergence and bias of \n<monospace>Adam</monospace>\n as the server optimizer in federated learning, and propose Adaptive Federated Adam (\n<monospace>AdaFedAdam</monospace>\n) to accelerate fair federated learning with alleviated bias. We validated the effectiveness, Pareto optimality and robustness of \n<monospace>AdaFedAdam</monospace>\n with numerical experiments and show that \n<monospace>AdaFedAdam</monospace>\n outperforms existing algorithms, providing better convergence and fairness properties of the federated scheme.","PeriodicalId":100641,"journal":{"name":"IEEE Transactions on Machine Learning in Communications and Networking","volume":"2 ","pages":"1017-1032"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10584508","citationCount":"0","resultStr":"{\"title\":\"Accelerating Fair Federated Learning: Adaptive Federated Adam\",\"authors\":\"Li Ju;Tianru Zhang;Salman Toor;Andreas Hellander\",\"doi\":\"10.1109/TMLCN.2024.3423648\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Federated learning is a distributed and privacy-preserving approach to train a statistical model collaboratively from decentralized data held by different parties. However, when the datasets are not independent and identically distributed, models trained by naive federated algorithms may be biased towards certain participants, and model performance across participants is non-uniform. This is known as the fairness problem in federated learning. In this paper, we formulate fairness-controlled federated learning as a dynamical multi-objective optimization problem to ensure the fairness and convergence with theoretical guarantee. To solve the problem efficiently, we study the convergence and bias of \\n<monospace>Adam</monospace>\\n as the server optimizer in federated learning, and propose Adaptive Federated Adam (\\n<monospace>AdaFedAdam</monospace>\\n) to accelerate fair federated learning with alleviated bias. We validated the effectiveness, Pareto optimality and robustness of \\n<monospace>AdaFedAdam</monospace>\\n with numerical experiments and show that \\n<monospace>AdaFedAdam</monospace>\\n outperforms existing algorithms, providing better convergence and fairness properties of the federated scheme.\",\"PeriodicalId\":100641,\"journal\":{\"name\":\"IEEE Transactions on Machine Learning in Communications and Networking\",\"volume\":\"2 \",\"pages\":\"1017-1032\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10584508\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Machine Learning in Communications and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10584508/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Machine Learning in Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10584508/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
联合学习是一种分布式和保护隐私的方法,用于从不同方持有的分散数据中协作训练统计模型。然而,当数据集不是独立和同分布的时候,用天真的联合算法训练出来的模型可能会偏向于某些参与者,而且不同参与者的模型性能也不一致。这就是联合学习中的公平性问题。在本文中,我们将公平性控制联合学习表述为一个动态多目标优化问题,以确保理论上的公平性和收敛性。为了高效地解决这个问题,我们研究了联盟学习中作为服务器优化器的 Adam 的收敛性和偏差,并提出了自适应联盟 Adam(AdaFedAdam),以加速公平联盟学习并减轻偏差。我们通过数值实验验证了 AdaFedAdam 的有效性、帕累托最优性和鲁棒性,结果表明 AdaFedAdam 优于现有算法,为联合方案提供了更好的收敛性和公平性。
Accelerating Fair Federated Learning: Adaptive Federated Adam
Federated learning is a distributed and privacy-preserving approach to train a statistical model collaboratively from decentralized data held by different parties. However, when the datasets are not independent and identically distributed, models trained by naive federated algorithms may be biased towards certain participants, and model performance across participants is non-uniform. This is known as the fairness problem in federated learning. In this paper, we formulate fairness-controlled federated learning as a dynamical multi-objective optimization problem to ensure the fairness and convergence with theoretical guarantee. To solve the problem efficiently, we study the convergence and bias of
Adam
as the server optimizer in federated learning, and propose Adaptive Federated Adam (
AdaFedAdam
) to accelerate fair federated learning with alleviated bias. We validated the effectiveness, Pareto optimality and robustness of
AdaFedAdam
with numerical experiments and show that
AdaFedAdam
outperforms existing algorithms, providing better convergence and fairness properties of the federated scheme.