{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:59:24Z","timestamp":1780635564624,"version":"3.54.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council through the European Union\u2019s Horizon 2020 Research and Innovation Program","doi-asserted-by":"publisher","award":["725731"],"award-info":[{"award-number":["725731"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/tnnls.2020.2979762","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T20:00:24Z","timestamp":1585944024000},"page":"962-974","source":"Crossref","is-referenced-by-count":27,"title":["LAGC: Lazily Aggregated Gradient Coding for Straggler-Tolerant and Communication-Efficient Distributed Learning"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1498-4912","authenticated-orcid":false,"given":"Jingjing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9898-3209","authenticated-orcid":false,"given":"Osvaldo","family":"Simeone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"recht","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS) Workshop"},{"key":"ref38","first-page":"803","article-title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed SGD","author":"dutta","year":"2018","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref32","article-title":"Efficient distributed hessian free algorithm for large-scale empirical risk minimization via accumulating sample strategy","author":"jahani","year":"2018","journal-title":"arXiv 1810 11507"},{"key":"ref31","first-page":"362","article-title":"DiSCO: Distributed optimization for self-concordant empirical loss","author":"zhang","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","first-page":"1000","article-title":"Communication-efficient distributed optimization using an approximate Newton-type method","author":"shamir","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref36","first-page":"1709","article-title":"SIGNSGD: Compressed optimisation for non-convex problems","author":"bernstein","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn (ICML)"},{"key":"ref35","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS) Workshop"},{"key":"ref34","first-page":"161","article-title":"The tradeoffs of large scale learning","author":"bottou","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS) Workshop"},{"key":"ref28","first-page":"3068","article-title":"Communication-efficient distributed dual coordinate ascent","author":"jaggi","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS)"},{"key":"ref27","first-page":"1306","article-title":"Gradient sparsification for communication-efficient distributed optimization","author":"wangni","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS) Workshop"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1278445"},{"key":"ref2","author":"abadi","year":"2015","journal-title":"Tensorflow Large-scale machine learning on heterogeneous distributed systems"},{"key":"ref1","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref22","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 (NeurIPS)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref24","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 (NeurIPS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref26","first-page":"3329","article-title":"Distributed mean estimation with limited communication","author":"suresh","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref25","first-page":"4035","article-title":"ZipML: Training linear models with end-to-end low precision, and a little bit of deep learning","author":"zhang","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508"},{"key":"ref10","first-page":"5050","article-title":"LAG: Lazily aggregated gradient for communication-efficient distributed learning","author":"chen","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316402276"},{"key":"ref40","first-page":"2408","article-title":"Optimizing neural networks with Kronecker-factored approximate curvature","author":"martens","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref12","first-page":"5606","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref14","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":"ref15","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"arXiv 1711 06771"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989328"},{"key":"ref18","article-title":"ErasureHead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019","journal-title":"arXiv 1901 09671"},{"key":"ref19","article-title":"Robust gradient descent via moment encoding with LDPC codes","author":"maity","year":"2018","journal-title":"arXiv 1805 08327"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920931"},{"key":"ref3","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2640087.2644155"},{"key":"ref8","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2200\/S00193ED1V01Y200905CAC006"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(97)00066-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755563"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.2307\/2285605"},{"key":"ref45","article-title":"Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication","author":"mallick","year":"2018","journal-title":"arXiv 1804 10331"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719062"},{"key":"ref42","article-title":"Optimization methods for large-scale machine learning","author":"bottou","year":"2016","journal-title":"arXiv 1606 04838"},{"key":"ref41","article-title":"Distributed second-order optimization using Kronecker-factored approximations","author":"ba","year":"2017","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref44","author":"schmidt","year":"2018","journal-title":"Lecture Slides Rates of Convergence"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF00229304"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9365681\/09056809.pdf?arnumber=9056809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:08Z","timestamp":1652194388000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9056809\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2020.2979762","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}