{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:35Z","timestamp":1773377615740,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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,7,12]]},"DOI":"10.1109\/isit45174.2021.9517990","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2280-2285","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Gradient Coding with Optimal Decoding"],"prefix":"10.1109","author":[{"given":"Margalit","family":"Glasgow","sequence":"first","affiliation":[{"name":"Stanford University,Department of Computer Science"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Computer Science and Electrical Engineering"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989328"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref13","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref14","article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394188"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0864-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CISS48834.2020.1570631711"},{"key":"ref18","article-title":"Byzantine stochastic gradient descent","volume":"2018","author":"alistarh","year":"0","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":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref3","first-page":"7","article-title":"Improving mapreduce performance in heterogeneous environments","volume":"8","author":"zaharia","year":"0","journal-title":"OSDI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref8","first-page":"903","article-title":"Draco: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref7","article-title":"Gradient coding via the stochastic block model","author":"charles","year":"2018","journal-title":"ArXiv Preprint"},{"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":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"9716","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"ICML 2018-35th International Conference on Machine Learning"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517990.pdf?arnumber=9517990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:37Z","timestamp":1773347677000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517990\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517990","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}