{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:11:04Z","timestamp":1774023064676,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARL","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}]},{"DOI":"10.13039\/100030807","name":"Commonwealth Cyber Initiative","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100030807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1109\/tcns.2023.3237489","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:16:23Z","timestamp":1673896583000},"page":"1669-1681","source":"Crossref","is-referenced-by-count":8,"title":["Byzantine Fault-Tolerance in Federated Local SGD Under $2f$-Redundancy"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-9319","authenticated-orcid":false,"given":"Nirupam","family":"Gupta","sequence":"first","affiliation":[{"name":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5135-3429","authenticated-orcid":false,"given":"Thinh T.","family":"Doan","sequence":"additional","affiliation":[{"name":"Bradley Department of Electrical and Computer Department, Virginia Tech, Blacksburg, VA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5104-8977","authenticated-orcid":false,"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Georgetown University, Washington, DC, USA"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Federated optimization: Distributed optimization beyond the datacenter","volume-title":"CoRR","volume":"abs\/1511.03575","author":"Konecny","year":"2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.2000552"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2021.103509"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2000200"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref8","first-page":"1","article-title":"DBA: Distributed backdoor attacks against federated learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xie","year":"2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008139"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933105"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405748"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7171098"},{"key":"ref13","article-title":"Byzantine fault tolerant distributed linear regression","volume-title":"CoRR","volume":"abs\/1903.08752","author":"Gupta","year":"2019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2606880"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2951686"},{"key":"ref16","first-page":"4618","article-title":"Byzantine stochastic gradient descent","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2018"},{"key":"ref17","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Int.Conf. Neural Inf. Process. Syst.","author":"Blanchard","year":"2017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055491"},{"key":"ref19","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in Byzantium","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guerraoui","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147396"},{"key":"ref21","first-page":"261","article-title":"Fall of empires: Breaking Byzantine-tolerant SGD by inner product manipulation","volume-title":"Proc. 35th Uncertainty Artif. Intell. Conf.","volume":"115","author":"Xie","year":"2020"},{"key":"ref22","first-page":"5636","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21638"},{"key":"ref24","article-title":"A nonconvex approach for phase retrieval: Reshaped Wirtinger flow and incremental algorithms","volume":"18","author":"Zhang","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref25","first-page":"1310","article-title":"On the difficulty of training recurrent neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pascanu","year":"2013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2928176"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2836919"},{"key":"ref30","article-title":"Phocas: Dimensional Byzantine-resilient stochastic gradient descent","volume-title":"CoRR","volume":"abs\/1805.09682","author":"Xie","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref32","article-title":"Election coding for distributed learning: Protecting SignSGD against Byzantine attacks","volume":"33","author":"Sohn","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref33","first-page":"1596","article-title":"Sever: A robust meta-algorithm for stochastic optimization","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Diakonikolas","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12364"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526806"},{"key":"ref36","first-page":"1605","article-title":"Local model poisoning attacks to Byzantine-robust federated learning","volume-title":"Proc. 29th USENIX Secur. Symp.","author":"Fang","year":"2020"},{"key":"ref37","article-title":"Byzantine-robust federated machine learning through adaptive model averaging","volume-title":"CoRR","volume":"abs\/1909.05125","author":"Muoz-Gonzlez","year":"2019"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3012952"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187906"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897647"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3041404"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24434"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467902"},{"key":"ref44","first-page":"6246","article-title":"Byzantine machine learning made easy by resilient averaging of momentums","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Farhadkhani","year":"2022"},{"key":"ref45","first-page":"1","article-title":"Distributed momentum for Byzantine-resilient stochastic gradient descent","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Mhamdi","year":"2021"},{"key":"ref46","first-page":"5311","article-title":"Learning from history for Byzantine robust optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2021"},{"key":"ref47","article-title":"Resilience in collaborative optimization: Redundant and independent cost functions","volume-title":"CoRR","volume":"abs\/2003.09675","author":"Gupta","year":"2020"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3571306.3571393"},{"key":"ref49","article-title":"Generalized Byzantine-tolerant SGD","volume-title":"CoRR","volume":"abs\/1802.10116","author":"Xie","year":"2018"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6509490\/10364889\/10018265.pdf?arnumber=10018265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:51:01Z","timestamp":1705017061000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10018265\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":49,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2023.3237489","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"value":"2325-5870","type":"electronic"},{"value":"2372-2533","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]}}}