{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:19:38Z","timestamp":1763810378471,"version":"3.37.3"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"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 through the Cooperative Agreement","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":"University of California-National Laboratories","award":["LFR-18-548554"],"award-info":[{"award-number":["LFR-18-548554"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1740047"],"award-info":[{"award-number":["1740047"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1527550","1514531"],"award-info":[{"award-number":["1527550","1514531"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"publisher","award":["7200594"],"award-info":[{"award-number":["7200594"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Hong Kong Research Grant Council","doi-asserted-by":"publisher","award":["ECS 21212419"],"award-info":[{"award-number":["ECS 21212419"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1109\/tit.2020.3035868","type":"journal-article","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T21:02:33Z","timestamp":1604523753000},"page":"1117-1140","source":"Crossref","is-referenced-by-count":21,"title":["Data Encoding for Byzantine-Resilient Distributed Optimization"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3544-8414","authenticated-orcid":false,"given":"Deepesh","family":"Data","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2756-4984","authenticated-orcid":false,"given":"Linqi","family":"Song","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7313-9861","authenticated-orcid":false,"given":"Suhas N.","family":"Diggavi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1865","article-title":"Stochastic methods for $l_{1}$\n  -regularized loss minimization","volume":"12","author":"shalev-shwartz","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref38","article-title":"An equivalence between the lasso and support vector machines","author":"jaggi","year":"2013","journal-title":"CoRR"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref32","article-title":"Byzantine-robust learning on heterogeneous datasets via resampling","author":"he","year":"2020","journal-title":"CoRR"},{"key":"ref31","article-title":"Byzantine-resilient high-dimensional SGD with local iterations on heterogeneous data","author":"data","year":"2020","journal-title":"CoRR"},{"key":"ref30","article-title":"Byzantine-resilient SGD in high dimensions on heterogeneous data","author":"data","year":"2020","journal-title":"CoRR"},{"journal-title":"Convex Optimization Lecture Notes","year":"2015","author":"tibshirani","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref34","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918"},{"key":"ref28","article-title":"Robust federated learning in a heterogeneous environment","author":"ghosh","year":"2019","journal-title":"CoRR"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref29","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849857"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636017"},{"key":"ref20","first-page":"5636","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","author":"yin","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn (ICML)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3322205.3311083"},{"key":"ref21","first-page":"4618","article-title":"Byzantine stochastic gradient descent","author":"alistarh","year":"2018","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref24","first-page":"7074","article-title":"Defending against saddle point attack in Byzantine-robust distributed learning","author":"yin","year":"2019","journal-title":"Proc ICML"},{"key":"ref23","first-page":"6893","article-title":"Zeno: Distributed stochastic gradient descent with suspicion-based fault-tolerance","author":"xie","year":"2019","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref26","first-page":"10320","article-title":"DETOX: A redundancy-based framework for faster and more robust gradient aggregation","author":"rajput","year":"2019","journal-title":"Proc NIPS"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919735"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927802"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"ref58","first-page":"191","article-title":"Mathematical properties and analysis of Google’s pagerank","volume":"34","author":"ipsen","year":"2006","journal-title":"Boletín de la Sociedad Española de Matemática Aplicada"},{"key":"ref57","first-page":"1","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn (ICML)"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","article-title":"A stochastic approximation method","volume":"22","author":"herbert","year":"1951","journal-title":"Ann Math Statist"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914344"},{"journal-title":"Linear Algebra","year":"1971","author":"hoffman","key":"ref54"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/0607059"},{"journal-title":"Probability and Measure","year":"1995","author":"billingsley","key":"ref52"},{"key":"ref10","first-page":"118","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"blanchard","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref11","first-page":"902","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn (ICML) Stockholm"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219655"},{"journal-title":"Parallel and Distributed Computation Numerical Methods","year":"1989","author":"bertsekas","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref15","first-page":"1232","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref16","first-page":"321","article-title":"Parallel coordinate descent for l1-regularized loss minimization","author":"bradley","year":"2011","journal-title":"Proc ICML"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0901-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849217"},{"key":"ref6","first-page":"5336","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref5","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"article-title":"Stochastic, distributed and federated optimization for machine learning","year":"2017","author":"konecn\u00fd","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00112"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437887"},{"key":"ref48","first-page":"72:1","article-title":"Redundancy techniques for straggler mitigation in distributed optimization and learning","volume":"20","author":"karakus","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref42","first-page":"3518","article-title":"The hidden vulnerability of distributed learning in Byzantium","author":"mhamdi","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn (ICML)"},{"key":"ref41","first-page":"5440","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref44","first-page":"4302","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn (ICML)"},{"key":"ref43","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9333790\/9248056-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9333790\/09248056.pdf?arnumber=9248056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:15Z","timestamp":1652194455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9248056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":61,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3035868","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,2]]}}}