{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T18:34:00Z","timestamp":1784399640763,"version":"3.55.0"},"reference-count":89,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CCF-1740551"],"award-info":[{"award-number":["CCF-1740551"]}]},{"name":"NSF","award":["CCF-1703574"],"award-info":[{"award-number":["CCF-1703574"]}]},{"name":"NSF","award":["DMS-1839371"],"award-info":[{"award-number":["DMS-1839371"]}]},{"DOI":"10.13039\/100001906","name":"Washington Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100001906","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007631","name":"Canadian Institute for Advanced Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007631","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JP Morgan Ph.D. Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3153135","type":"journal-article","created":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T20:23:46Z","timestamp":1645734226000},"page":"1142-1154","source":"Crossref","is-referenced-by-count":657,"title":["Robust Aggregation for Federated Learning"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1262-8466","authenticated-orcid":false,"given":"Krishna","family":"Pillutla","sequence":"first","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sham M.","family":"Kakade","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaid","family":"Harchaoui","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref3","article-title":"Applied federated learning: Improving google keyboard query suggestions","volume-title":"CoRR","volume":"abs\/1812.02903","author":"Yang","year":"2018"},{"key":"ref4","article-title":"Federated collaborative filtering for privacy-preserving personalized recommendation system","volume-title":"CoRR","volume":"abs\/1901.09888","author":"din","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2009.2032660"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2019.103291"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2919736"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00032"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00487"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417885"},{"key":"ref13","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","author":"Bonawitz","year":"2019"},{"key":"ref14","first-page":"355","article-title":"On the point for which the sum of the distances to n given points is minimum","volume":"43","author":"Weiszfeld","year":"1937","journal-title":"Tohoku Math. J., First Ser."},{"key":"ref17","first-page":"2496","article-title":"Hypothesis testing interpretations and renyi differential privacy","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Balle","year":"2020"},{"key":"ref18","first-page":"4424","article-title":"Federated multi-task learning","volume-title":"Proc. Adv. Neural Informat. Process. Syst.","volume":"30","author":"Smith","year":"2017"},{"key":"ref19","first-page":"4615","article-title":"Agnostic federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Mohri","year":"2019"},{"key":"ref20","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","author":"Li","year":"2020"},{"key":"ref21","first-page":"5132","article-title":"Scaffold: Stochastic controlled averaging for federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2020"},{"key":"ref22","first-page":"21394","article-title":"Personalized federated learning with moreau envelopes","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Dinh","year":"2020"},{"key":"ref23","first-page":"3557","article-title":"Personalized federated learning with theoretical guarantees: A model-agnostic meta-learning approach","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Fallah","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400318"},{"key":"ref25","first-page":"425","article-title":"Federated learning under arbitrary communication patterns","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"139","author":"Avdiukhin","year":"2021"},{"key":"ref26","article-title":"Adaptive federated optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Reddi","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref28","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1997"},{"key":"ref29","first-page":"230:1","article-title":"COCOA: A general framework for communication-efficient distributed optimization","volume":"18","author":"Smith","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1278445"},{"key":"ref31","first-page":"4541","article-title":"COLA: Decentralized linear learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"He","year":"2018"},{"key":"ref32","first-page":"81:1","article-title":"Improved asynchronous parallel optimization analysis for stochastic incremental methods","volume":"19","author":"Leblond","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988515"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1007\/978-3-642-04898-2_594","volume-title":"Robust Statistics. in International Encyclopedia of Statistical Science","author":"Huber","year":"2011"},{"key":"ref36","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovski","year":"1983"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3150\/14-BEJ645"},{"key":"ref38","first-page":"18:1","article-title":"Loss minimization and parameter estimation with heavy tails","volume":"17","author":"Hsu","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/937"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1214\/19-aos1828"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3150\/18-bej1046"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.85"},{"key":"ref43","article-title":"Uniform bounds for robust mean estimators","author":"Minsker","year":"2019"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.171"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2703664"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2893846"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2931171"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref49","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Blanchard","year":"2017"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref51","first-page":"902","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2018"},{"key":"ref52","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":"ref53","first-page":"4618","article-title":"Byzantine stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2018"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2946020"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134098"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584648"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011435"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0586-7"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580224"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897647"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref63","first-page":"5201","article-title":"The distributed discrete Gaussian mechanism for federated learning with secure aggregation","volume-title":"Proc. ICML","volume":"139","author":"Kairouz"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1666420.1666444"},{"key":"ref65","article-title":"Federated learning: A signal processing perspective","volume-title":"CoRR","volume":"abs\/2103.17150","author":"Gafni","year":"2021"},{"key":"ref66","article-title":"A field guide to federated optimization","volume-title":"CoRR","volume":"abs\/2107.06917","author":"Wang","year":"2021"},{"key":"ref67","first-page":"57","article-title":"The notion of breakdown point","volume":"157184","author":"Donoho","year":"1983","journal-title":"A festschrift Erich L. Lehmann"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835090"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1607"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347978"},{"key":"ref71","first-page":"773","article-title":"Non-strongly-convex smooth stochastic approximation with convergence rate $O(1\/n)$","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bach","year":"2013"},{"key":"ref72","first-page":"2:1","article-title":"A Markov chain theory approach to characterizing the minimax optimality of stochastic gradient descent (for least squares","volume-title":"Proc. Conf. Found. Softw. Technol. Theor. Comput. Sci.","volume":"2","author":"Jain","year":"2017"},{"key":"ref73","first-page":"223:1","article-title":"Parallelizing stochastic gradient descent for least squares regression: Mini-batching, averaging, and model misspecification","volume":"18","author":"Jain","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-38438-8"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3012952"},{"key":"ref76","article-title":"Federated residual learning","volume-title":"CoRR","volume":"abs\/2003.12880","author":"Agarwal","year":"2020"},{"key":"ref77","article-title":"LEAF: A benchmark for federated settings","volume-title":"CoRR","volume":"abs\/1812.01097","author":"Caldas"},{"key":"ref78","article-title":"EMNIST: An extension of MNIST to handwritten letters","volume-title":"CoRR","volume":"abs\/1702.05373","author":"Cohen","year":"2017"},{"key":"ref79","article-title":"The complete works of William Shakespeare","author":"Shakespeare"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref81","first-page":"1","article-title":"Twitter sentiment classification using distant supervision","author":"Go","year":"2009"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref83","article-title":"Understanding deep learning requires rethinking generalization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang","year":"2017"},{"key":"ref84","volume-title":"CoRR","volume":"abs\/1911.07963","author":"Sun","year":"2019"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1137\/100818327"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600425"},{"key":"ref87","first-page":"783","article-title":"Optimization with first-order surrogate functions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"J","year":"2013"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1137\/140957639"},{"key":"ref89","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Introductory Lectures on Convex Optimization","author":"Nesterov","year":"2018"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1137\/13094829X"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9675017\/9721118-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09721118.pdf?arnumber=9721118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T06:09:51Z","timestamp":1726726191000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9721118\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":89,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3153135","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}