{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:36:52Z","timestamp":1763105812008,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1814629"],"award-info":[{"award-number":["CCF-1814629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-1844628"],"award-info":[{"award-number":["CCF-1844628"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Sloan Research Fellowship"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DGE-1656518"],"award-info":[{"award-number":["DGE-1656518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1814629"],"award-info":[{"award-number":["CCF-1814629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-1844628"],"award-info":[{"award-number":["CCF-1844628"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Sloan Research Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/jsait.2021.3100110","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T22:06:16Z","timestamp":1627337176000},"page":"855-866","source":"Crossref","is-referenced-by-count":13,"title":["Approximate Gradient Coding With Optimal Decoding"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6605-2127","authenticated-orcid":false,"given":"Margalit","family":"Glasgow","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2345-2531","authenticated-orcid":false,"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"ErasureHead Distributed gradient descent without delays using approximate gradient coding","year":"2019","author":"wang","key":"ref10"},{"journal-title":"Gradient coding via the stochastic block model","year":"2018","author":"charles","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref14","first-page":"903","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","first-page":"5606","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849514"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CISS48834.2020.1570631711"},{"key":"ref18","article-title":"Byzantine stochastic gradient descent","volume":"31","author":"alistarh","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12154"},{"key":"ref4","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref3","first-page":"7","article-title":"Improving MapReduce performance in heterogeneous environments","volume":"8","author":"zaharia","year":"2008","journal-title":"OSDI"},{"key":"ref6","first-page":"4305","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"journal-title":"Approximate Gradient Coding via Sparse Random Graphs","year":"2017","author":"charles","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","first-page":"19","article-title":"Communication efficient distributed machine learning with the parameter server","author":"li","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref20","first-page":"1017","article-title":"Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm","author":"needell","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"journal-title":"Singular values of random matrices","year":"2009","author":"chafa?","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1968.1098852"},{"key":"ref23","first-page":"1","article-title":"Unconstraining graph-constrained group testing","author":"spang","year":"2019","journal-title":"Proc Approx Randomization Combinatorial Optim Algorithms Techn (APPROX\/RANDOM)"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9540917\/9496690-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9540917\/09496690.pdf?arnumber=9496690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:12Z","timestamp":1649444112000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9496690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":24,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3100110","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}