{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:24:23Z","timestamp":1773779063724,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["2139304"],"award-info":[{"award-number":["2139304"]}]},{"name":"NSF","award":["2146838"],"award-info":[{"award-number":["2146838"]}]},{"name":"NSF","award":["2007714"],"award-info":[{"award-number":["2007714"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tac.2024.3424693","type":"journal-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T17:31:17Z","timestamp":1720459877000},"page":"81-96","source":"Crossref","is-referenced-by-count":2,"title":["Decentralized Optimization Resilient Against Local Data Poisoning Attacks"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8206-9877","authenticated-orcid":false,"given":"Yanwen","family":"Mao","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3544-8414","authenticated-orcid":false,"given":"Deepesh","family":"Data","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7313-9861","authenticated-orcid":false,"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3417-0951","authenticated-orcid":false,"given":"Paulo","family":"Tabuada","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657817"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462038"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref5","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume-title":"Proc. USENIX Conf. Operating Syst. Des. Implementation","author":"Castro","year":"1999"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2004.1390734"},{"key":"ref7","first-page":"2478","article-title":"Byzantine-resilient high-dimensional SGD with local iterations on heterogeneous data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Data","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518248"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3105076"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref11","article-title":"Robust federated learning in a heterogeneous environment","author":"Ghosh","year":"2019"},{"key":"ref12","first-page":"4618","article-title":"Byzantine stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref14","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58951-6_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2613678"},{"key":"ref18","volume-title":"Lectures on Network Systems","author":"Bullo","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3188456"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2928176"},{"key":"ref21","article-title":"Resilience in collaborative optimization: Redundant and independent cost functions","author":"Gupta","year":"2020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49259-9_29"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.23919\/acc50511.2021.9483067"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467902"},{"key":"ref25","article-title":"Byzantine-robust learning on heterogeneous datasets via bucketing","volume-title":"Proc. 10th Int. Conf. Learn. Representations","author":"Karimireddy","year":"2022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933105"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2836919"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147396"},{"key":"ref29","article-title":"Byzantine-robust decentralized learning via clippedgossip","author":"He","year":"2022"},{"key":"ref30","first-page":"25 04425 057","article-title":"Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"-Mhamdi","year":"2021"},{"key":"ref31","article-title":"On the geometric convergence of byzantine-resilient distributed optimization algorithms","author":"Kuwaranancharoen","year":"2023"},{"key":"ref32","first-page":"8230","article-title":"Certified robustness to label-flipping attacks via randomized smoothing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rosenfeld","year":"2020"},{"key":"ref33","article-title":"Fast is better than free: Revisiting adversarial training","author":"Wong","year":"2020"},{"key":"ref34","article-title":"Certified defenses against adversarial examples","author":"Raghunathan","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2617829"},{"key":"ref36","first-page":"1689","article-title":"Is feature selection secure against training data poisoning?","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xiao","year":"2015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3128572.3140450"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40349-1_4"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813679"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.08.010"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2305952"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref43","first-page":"6246","article-title":"Byzantine machine learning made easy by resilient averaging of momentums","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Farhadkhani","year":"2022"},{"key":"ref44","first-page":"5311","article-title":"Learning from history for byzantine robust optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2021"},{"key":"ref45","first-page":"1649","article-title":"How hard is robust mean estimation?","volume-title":"Proc. Conf. Learn. Theory","author":"Hopkins","year":"2019"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126680"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1961"},{"key":"ref48","article-title":"Byzantine-robust learning on heterogeneous datasets via resampling","author":"He","year":"2020"},{"key":"ref49","volume-title":"Linear System Theory and Design","author":"Chen","year":"1999"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2019.2900783"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10818614\/10588971-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9\/10818614\/10588971.pdf?arnumber=10588971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:18:40Z","timestamp":1735625920000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10588971\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":50,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tac.2024.3424693","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}