{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:13Z","timestamp":1773377593332,"version":"3.50.1"},"reference-count":27,"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.9517849","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2274-2279","source":"Crossref","is-referenced-by-count":8,"title":["On Gradient Coding with Partial Recovery"],"prefix":"10.1109","author":[{"given":"Sahasrajit","family":"Sarmasarkar","sequence":"first","affiliation":[{"name":"IIT,Department of Electrical Engineering,Bombay,India"}]},{"given":"V.","family":"Lalitha","sequence":"additional","affiliation":[{"name":"IIIT,Signal Processing & Communications Research Center,Hyderabad,India"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"IIT,Department of Electrical Engineering,Bombay,India"}]}],"member":"263","reference":[{"key":"ref10","first-page":"5610","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"0","journal-title":"Int Conference on Machine Learning"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849684"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3390\/e22050544"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00062"},{"key":"ref14","article-title":"Distributed linearly separable computation","author":"wan","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref15","first-page":"803","article-title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed sgd","author":"dutta","year":"0","journal-title":"Int Conf on Artificial Intelligence and Statistics"},{"key":"ref16","author":"chen","year":"2017","journal-title":"Revisiting Distributed Synchronous SGD"},{"key":"ref17","first-page":"177","article-title":"Large-scale machine learning with stochastic gradient descent","author":"bottou","year":"0","journal-title":"Proceedings of COMPSTAT'2010"},{"key":"ref18","article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref4","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"0","journal-title":"Int Conference on Machine Learning"},{"key":"ref27","article-title":"On gradient coding with partial recovery","author":"sarmasarkar","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref3","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"0","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref5","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"0","journal-title":"In The 22nd International Conference on Artificial Intelligence and Statistics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849514"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394188"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053961"},{"key":"ref23","author":"charles","year":"2017","journal-title":"Approximate Gradient Coding via Sparse Random Graphs"},{"key":"ref26","article-title":"Coded distributed computing with partial recovery","author":"ozfatura","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"}],"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\/09517849.pdf?arnumber=9517849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:31Z","timestamp":1773347671000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517849\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517849","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}