{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:54:14Z","timestamp":1730278454592,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611493","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T16:46:27Z","timestamp":1637685987000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Gradient Coding for Heterogeneous Nodes"],"prefix":"10.1109","author":[{"given":"Amogh","family":"Johri","sequence":"first","affiliation":[]},{"given":"Arti","family":"Yardi","sequence":"additional","affiliation":[]},{"given":"Tejas","family":"Bodas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref12","article-title":"Approximate gradient coding with optimal decoding","author":"glasgow","year":"2020","journal-title":"available at arXiv 2006 09638 [stat ML]"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849235"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3323679.3326528"},{"journal-title":"Deep learning on AWS Guide","year":"2019","author":"kahlir","key":"ref15"},{"journal-title":"Announcing the preview of Azure shared disks for clustered applications Azure blog and updates Microsoft Azure","year":"0","author":"brockway","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90446-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref19","first-page":"367","article-title":"Stochastic gradient coding for flexible straggler mitigation in distributed learning","author":"radenski","year":"2011","journal-title":"International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA)"},{"key":"ref4","article-title":"Coded distributed computing with partial recovery","author":"ozfatura","year":"2020","journal-title":"available at arXiv 2007 02191 [cs IT]"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref6","article-title":"Speeding up distributed gradient descent by utilizing non-persistent stragglers","author":"ozfatura","year":"2018","journal-title":"available at arXiv 1808 02240 [cs IT]"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755563"},{"key":"ref8","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"available at arXiv 1711 06771 [stat ML]"},{"key":"ref7","first-page":"4305","article-title":"Gradient coding from cyclic MDS codes and expander graphs","volume":"80","author":"raviv","year":"2018","journal-title":"Proceedings of the 35th International Conference on Machine Learning"},{"key":"ref2","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume":"70","author":"tandon","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning (PMLR)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2017","journal-title":"available at arXiv 1901 09671 [cs LG]"},{"journal-title":"Introduction to Finite Fields and Their Applications","year":"1986","author":"lidl","key":"ref20"},{"journal-title":"The Theory of Error Correcting Codes","year":"1977","author":"macwilliams","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(73)90518-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00062"},{"journal-title":"Linear Algebra and its Applications","year":"2006","author":"strang","key":"ref23"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611493.pdf?arnumber=9611493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:52:07Z","timestamp":1652187127000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611493\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611493","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}