{"title":"关于 \"具有差异隐私的联合学习:算法和性能分析\"","authors":"Mahtab Talaei, Iman Izadi","doi":"arxiv-2406.05858","DOIUrl":null,"url":null,"abstract":"In the paper by Wei et al. (\"Federated Learning with Differential Privacy:\nAlgorithms and Performance Analysis\"), the convergence performance of the\nproposed differential privacy algorithm in federated learning (FL), known as\nNoising before Model Aggregation FL (NbAFL), was studied. However, the\npresented convergence upper bound of NbAFL (Theorem 2) is incorrect. This\ncomment aims to present the correct form of the convergence upper bound for\nNbAFL.","PeriodicalId":501291,"journal":{"name":"arXiv - CS - Performance","volume":"72 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comments on \\\"Federated Learning with Differential Privacy: Algorithms and Performance Analysis\\\"\",\"authors\":\"Mahtab Talaei, Iman Izadi\",\"doi\":\"arxiv-2406.05858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper by Wei et al. (\\\"Federated Learning with Differential Privacy:\\nAlgorithms and Performance Analysis\\\"), the convergence performance of the\\nproposed differential privacy algorithm in federated learning (FL), known as\\nNoising before Model Aggregation FL (NbAFL), was studied. However, the\\npresented convergence upper bound of NbAFL (Theorem 2) is incorrect. This\\ncomment aims to present the correct form of the convergence upper bound for\\nNbAFL.\",\"PeriodicalId\":501291,\"journal\":{\"name\":\"arXiv - CS - Performance\",\"volume\":\"72 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.05858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.05858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comments on "Federated Learning with Differential Privacy: Algorithms and Performance Analysis"
In the paper by Wei et al. ("Federated Learning with Differential Privacy:
Algorithms and Performance Analysis"), the convergence performance of the
proposed differential privacy algorithm in federated learning (FL), known as
Noising before Model Aggregation FL (NbAFL), was studied. However, the
presented convergence upper bound of NbAFL (Theorem 2) is incorrect. This
comment aims to present the correct form of the convergence upper bound for
NbAFL.