{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:57:01Z","timestamp":1730195821696,"version":"3.28.0"},"reference-count":48,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/allerton.2018.8635933","type":"proceedings-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T22:04:31Z","timestamp":1551391471000},"page":"196-203","source":"Crossref","is-referenced-by-count":10,"title":["Cross-Iteration Coded Computing"],"prefix":"10.1109","author":[{"given":"Farzin","family":"Haddadpour","sequence":"first","affiliation":[]},{"given":"Yaoqing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Viveck","family":"Cadambe","sequence":"additional","affiliation":[]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref38","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2018","journal-title":"arXiv preprint arXiv 1801 10292 submitted to Transactions on Information Theory"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/978-3-319-70087-8_73","article-title":"Coded Distributed Computing for Inverse Problems","author":"yang","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852335"},{"key":"ref31","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018","journal-title":"arXiv preprint arXiv 1806 00939"},{"key":"ref30","article-title":"Robust gradient descent via moment encoding with ldpc codes","author":"maity","year":"2018","journal-title":"arXiv preprint arXiv 1805 08327"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref36","article-title":"Coded iterative computing using substitute decoding","author":"yang","year":"2018","journal-title":"arXiv preprint arXiv 1805 06046"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437459"},{"key":"ref34","article-title":"Polynomially coded regression: Optimal straggler mitigation via data encoding","author":"li","year":"2018","journal-title":"arXiv preprint arXiv 1805 09934"},{"key":"ref10","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"arXiv preprint arxiv 1802 05807"},{"article-title":"Codenet: Training Large Neural Networks in presence of Soft-Errors","year":"2018","author":"dutta","key":"ref40"},{"key":"ref11","article-title":"Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication","author":"mallick","year":"2018","journal-title":"arXiv preprint arXiv 1804 10204"},{"key":"ref12","article-title":"Coded FFT and Its Communication Overhead","author":"jeong","year":"2018","journal-title":"submitted"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref28","first-page":"5440","article-title":"Straggler Mitigation in Distributed Optimization through Data Encoding","author":"karakus","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref4","first-page":"3068","article-title":"Communication-efficient distributed dual coordinate ascent","author":"jaggi","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref3","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref6","article-title":"Parallel stochastic gradient descent with sound combiners","author":"maleki","year":"2017","journal-title":"arXiv preprint arXiv 1705 08030"},{"key":"ref29","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"arXiv preprint arXiv 1711 03890"},{"key":"ref5","article-title":"Improving the privacy and accuracy of admm-based distributed algorithms","author":"zhang","year":"2018","journal-title":"arXiv preprint arXiv 1806 02246"},{"key":"ref8","first-page":"2092","article-title":"Short-Dot: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","author":"dutta","year":"2016","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref2","first-page":"230","article-title":"Cocoa: A general framework for communication-efficient distributed optimization","volume":"18","author":"smith","year":"2018","journal-title":"Journal of Machine Learning Research"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"journal-title":"Software Engineering Advice from Building Large-scale Distributed Systems","year":"2007","author":"dean","key":"ref1"},{"key":"ref46","first-page":"4404","article-title":"Distributed stochastic variance reduced gradient methods by sampling extra data with replacement","volume":"18","author":"lee","year":"2017","journal-title":"The Journal of Machine Learning Research"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref45","article-title":"Revisiting distributed synchronous sgd","author":"chen","year":"2016","journal-title":"arXiv preprint arXiv 1604 00981"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426691"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref47","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852337"},{"key":"ref42","first-page":"4403","article-title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","author":"yu","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref24","first-page":"3368","article-title":"Gradient Coding: Avoiding Stragglers in Distributed Learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning (ICML)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref44","article-title":"Straggler-resilient and communication-efficient distributed iterative linear solver","author":"haddadpour","year":"2018","journal-title":"arXiv preprint arXiv 1806 06140"},{"key":"ref26","article-title":"Improving Distributed Gradient Descent Using Reed-Solomon Codes","author":"halbawi","year":"2017","journal-title":"arXiv preprint arXiv 1706 05436"},{"key":"ref43","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"arXiv preprint arxiv 1802 05807"},{"key":"ref25","article-title":"Gradient Coding from Cyclic MDS Codes and Expander Graphs","author":"raviv","year":"2017","journal-title":"arXiv preprint arXiv 1707 07816"}],"event":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2018,10,2]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8630872\/8635635\/08635933.pdf?arnumber=8635933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T19:08:15Z","timestamp":1598209695000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8635933\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/allerton.2018.8635933","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}