{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:23:29Z","timestamp":1771514609551,"version":"3.50.1"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1801708"],"award-info":[{"award-number":["CNS-1801708"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1657049"],"award-info":[{"award-number":["CCF-1657049"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-1844628"],"award-info":[{"award-number":["CCF-1844628"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/jsait.2020.2991361","type":"journal-article","created":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T21:11:34Z","timestamp":1588194694000},"page":"277-291","source":"Crossref","is-referenced-by-count":68,"title":["Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning"],"prefix":"10.1109","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4421-1024","authenticated-orcid":false,"given":"Rawad","family":"Bitar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2345-2531","authenticated-orcid":false,"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[]},{"given":"Salim","family":"El Rouayheb","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref33","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref32","author":"yu","year":"2018","journal-title":"Lagrange coded computing Optimal design for resiliency security and privacy"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635903"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref36","author":"chen","year":"2018","journal-title":"DRACO Robust distributed training via redundant gradients"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref34","author":"ozfaturay","year":"2018","journal-title":"Speeding up distributed gradient descent by utilizing non-persistent stragglers"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref62","first-page":"873","article-title":"Distributed delayed stochastic optimization","author":"agarwal","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref61","first-page":"1647","article-title":"Better mini-batch algorithms via accelerated gradient methods","author":"cotter","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref63","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"dekel","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref28","year":"2019","journal-title":"SGC GitHub Repository"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028543"},{"key":"ref27","first-page":"279","article-title":"Batched stochastic gradient descent with weighted sampling","author":"needell","year":"2016","journal-title":"Proc Conf Approx Theory"},{"key":"ref65","volume":"23","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref66","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref29","author":"halbawi","year":"2017","journal-title":"Improving distributed gradient descent using Reed–Solomon codes"},{"key":"ref67","author":"dutta","year":"2018","journal-title":"Slow and stale gradients can win the race Error-runtime trade-offs in distributed SGD"},{"key":"ref68","first-page":"1531","article-title":"Asynchronous stochastic convex optimization: The noise is in the noise and SGD don’t care","author":"chaturapruek","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989328"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849580"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682911"},{"key":"ref26","first-page":"1017","article-title":"Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm","author":"needell","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282699"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2674671"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284026"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483236"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3152042.3152047"},{"key":"ref53","author":"wang","year":"2018","journal-title":"Fundamental limits of coded linear transform"},{"key":"ref52","first-page":"2100","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 (NIPS)"},{"key":"ref10","first-page":"142","volume":"17","author":"bottou","year":"1998","journal-title":"Online Learning and Stochastic Approximations"},{"key":"ref11","first-page":"1865","article-title":"Stochastic methods for ??-regularized loss minimization","volume":"12","author":"shalev-shwartz","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref12","first-page":"213","article-title":"Distributed asynchronous online learning for natural language processing","author":"gimpel","year":"2010","journal-title":"Proc Conf Comput Nat Lang Learn"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"ref14","author":"rakhlin","year":"2011","journal-title":"Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref17","author":"maity","year":"2018","journal-title":"Robust gradient descent via moment encoding with ldpc codes"},{"key":"ref18","author":"charles","year":"2017","journal-title":"Approximate Gradient Coding via Sparse Random Graphs"},{"key":"ref19","author":"wang","year":"2019","journal-title":"ErasureHead Distributed gradient descent without delays using approximate gradient coding"},{"key":"ref4","first-page":"24","article-title":"Reining in the outliers in MapReduce clusters using Mantri","volume":"10","author":"ananthanarayanan","year":"2010","journal-title":"Proc of the 2nd USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref3","author":"chen","year":"2016","journal-title":"Revisiting Distributed Synchronous SGD"},{"key":"ref6","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref5","first-page":"7","article-title":"Improving MapReduce performance in heterogeneous environments","volume":"8","author":"zaharia","year":"2008","journal-title":"Proc of the 2nd USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref7","first-page":"9716","article-title":"Communication-computation efficient gradient coding","volume":"12","author":"ye","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref49","author":"mallick","year":"2018","journal-title":"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication"},{"key":"ref9","first-page":"4302","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref45","author":"wang","year":"2018","journal-title":"Coded sparse matrix multiplication"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref41","author":"keshtkarjahromi","year":"2018","journal-title":"Coded cooperative computation for Internet of Things"},{"key":"ref44","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755695"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/8768428\/9081964-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/8768428\/09081964.pdf?arnumber=9081964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:16:35Z","timestamp":1651065395000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9081964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":68,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2020.2991361","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}