{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:31Z","timestamp":1773377791682,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849514","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2734-2738","source":"Crossref","is-referenced-by-count":31,"title":["Robust Gradient Descent via Moment Encoding and LDPC Codes"],"prefix":"10.1109","author":[{"given":"Raj Kumar","family":"Maity","sequence":"first","affiliation":[{"name":"CICS, University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Singh Rawa","sequence":"additional","affiliation":[{"name":"Research Laboratory of Electronics, MIT, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"CICS, University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref14","article-title":"Swarm user documentation","year":"0"},{"key":"ref15","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc of ICML"},{"key":"ref16","first-page":"5440","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"NIPS"},{"key":"ref17","article-title":"Coding method for parallel iterative linear solver","author":"yang","year":"2017"},{"key":"ref18","article-title":"Robust gradient descent via moment encoding with ldpc codes","author":"maity","year":"2018"},{"key":"ref19","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 AISTATS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2506161"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref5","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","author":"ananthanarayanan","year":"2013","journal-title":"Proc of NSDI"},{"key":"ref8","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"NIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref2","first-page":"10","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"Proc of HotCloud"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553417"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849514.pdf?arnumber=8849514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:10Z","timestamp":1773347710000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849514\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849514","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}