{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:47Z","timestamp":1773376607691,"version":"3.50.1"},"reference-count":49,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206449","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1336-1341","source":"Crossref","is-referenced-by-count":2,"title":["Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load"],"prefix":"10.1109","author":[{"given":"Maximilian","family":"Egger","sequence":"first","affiliation":[{"name":"Technical University of Munich,Munich,Germany"}]},{"given":"Serge Kas","family":"Hanna","sequence":"additional","affiliation":[{"name":"Aalto University,Espoo,Finland"}]},{"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Munich,Germany"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref12","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref15","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref14","first-page":"903","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","volume":"80","author":"chen","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635903"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref17","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Conference on Neural Information Processing Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00013"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127580"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref42","first-page":"1476","article-title":"Convergence diagnostics for stochastic gradient descent with constant learning rate","volume":"84","author":"chee","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF01301683"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2019.8891198"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142295"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206449"},{"key":"ref8","first-page":"5610","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"0"},{"key":"ref7","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142358"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000103","article-title":"Coded computing: Mitigating fundamental bottlenecks in large-scale distributed computing and machine learning","volume":"17","author":"li","year":"2020","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3180941"},{"key":"ref40","article-title":"Adaptive stochastic gradient descent for fast and communication-efficient distributed learning","author":"kas hanna","year":"2022"},{"key":"ref35","first-page":"7641","article-title":"On convergence-diagnostic based step sizes for stochastic gradient descent","author":"pesme","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref34","first-page":"63","article-title":"A statistical study of on-line learning","author":"murata","year":"1998","journal-title":"Online Learning and Neural Networks"},{"key":"ref37","article-title":"Don’t decay the learning rate, increase the batch size","author":"smith","year":"2018"},{"key":"ref36","article-title":"The step decay schedule: A near optimal, geometrically decaying learning rate procedure for least squares","volume":"32","author":"ge","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517849"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3133791"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref32","article-title":"Revisiting distributed synchronous SGD","author":"chen","year":"2016"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref39","article-title":"Adaptive distributed stochastic gradient descent for minimizing delay in the presence of stragglers","author":"kas hanna","year":"2020","journal-title":"IEEE International Conference on Acoustics Speech and Signal Processing"},{"key":"ref38","first-page":"803","article-title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed SGD","volume":"84","author":"dutta","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref24","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174120"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849514"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988506"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/e22050544"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952051"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref27","article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3100110"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206449.pdf?arnumber=10206449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:53Z","timestamp":1773347213000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206449\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206449","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}