{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:11:51Z","timestamp":1772907111916,"version":"3.50.1"},"reference-count":111,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["NSF-2217058"],"award-info":[{"award-number":["NSF-2217058"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["NSF-2133484"],"award-info":[{"award-number":["NSF-2133484"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["NSF-2246157"],"award-info":[{"award-number":["NSF-2246157"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["ECCS-2037304"],"award-info":[{"award-number":["ECCS-2037304"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["DMS-2134248"],"award-info":[{"award-number":["DMS-2134248"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF CAREER Award","award":["CCF-2236829"],"award-info":[{"award-number":["CCF-2236829"]}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF2310343"],"award-info":[{"award-number":["W911NF2310343"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S. Army Research Office Early Career Award","award":["W911NF-21-1-0242"],"award-info":[{"award-number":["W911NF-21-1-0242"]}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-NA0003921"],"award-info":[{"award-number":["DE-NA0003921"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-24-1-2164"],"award-info":[{"award-number":["N00014-24-1-2164"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tit.2024.3420222","type":"journal-article","created":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T19:55:16Z","timestamp":1719518116000},"page":"6639-6664","source":"Crossref","is-referenced-by-count":3,"title":["Gradient Coding With Iterative Block Leverage Score Sampling"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-1467","authenticated-orcid":false,"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0870-9992","authenticated-orcid":false,"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2531-9670","authenticated-orcid":false,"given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.31"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.134"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1540276.1540294"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1201\/b11644-17"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref9","article-title":"Dimensionality reduction for k-means clustering","author":"Charalambides","year":"2020","journal-title":"arXiv:2007.13185"},{"key":"ref10","first-page":"291","article-title":"Clustering in large graphs and matrices","volume-title":"Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Drineas"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref15","article-title":"Lecture notes on randomized linear algebra","author":"Mahoney","year":"2016","journal-title":"arXiv:1608.04481"},{"key":"ref16","article-title":"Projection-cost-preserving sketches: Proof strategies and constructions","author":"Musco","year":"2020","journal-title":"arXiv:2004.08434"},{"key":"ref17","article-title":"A practical guide to randomized matrix computations with MATLAB implementations","author":"Wang","year":"2015","journal-title":"arXiv:1505.07570"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2842602"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492917000058"},{"key":"ref21","article-title":"Randomized numerical linear algebra: A perspective on the field with an eye to software","author":"Murray","year":"2023","journal-title":"arXiv:2302.11474"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396365"},{"key":"ref23","first-page":"420","article-title":"Block Krylov space methods for linear systems with multiple right-hand sides: An introduction","author":"Gutknecht","year":"2007","journal-title":"Modern Mathematical Models, Methods and Algorithms for Real World Systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.022"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-020-00895-9"},{"issue":"1","key":"ref26","first-page":"1842","article-title":"Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"Pilanci","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/15M1021106"},{"key":"ref28","first-page":"1","article-title":"Optimal iterative sketching with the subsampled randomized Hadamard transform","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Lacotte"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10928-8_22"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/icassp39728.2021.9413800"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3247559"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054153"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622139"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378289"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref38","article-title":"Straggler mitigation through unequal error protection for distributed approximate matrix multiplication","author":"Tegin","year":"2021","journal-title":"arXiv:2103.02928"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206890"},{"key":"ref40","first-page":"29","article-title":"Improving MapReduce performance in heterogeneous environments","volume-title":"Proc. USENIX Assoc.","author":"Zaharia"},{"key":"ref41","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174512"},{"key":"ref43","article-title":"Generalized fractional repetition codes for binary coded computations","author":"Charalambides","year":"2021","journal-title":"arXiv:2109.10484"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3091684"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623698"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852337"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849370"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959921"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3182943"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834356"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3384395"},{"key":"ref58","article-title":"Approximate gradient coding via sparse random graphs","author":"Charles","year":"2017","journal-title":"arXiv:1711.06771"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3100110"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437887"},{"key":"ref61","article-title":"ErasureHead: Distributed gradient descent without delays using approximate gradient coding","author":"Wang","year":"2019","journal-title":"arXiv:1901.09671"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref63","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","author":"Chen","year":"2018","journal-title":"arXiv:1803.09877"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849580"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849514"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2927558"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref70","article-title":"Polar coded distributed matrix multiplication","author":"Bartan","year":"2019","journal-title":"arXiv:1901.06811"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989097"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3099811"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3190859"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095909"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517750"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518059"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"issue":"1","key":"ref79","first-page":"861","article-title":"A statistical perspective on algorithmic leveraging","volume":"16","author":"Ma","year":"2015","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"ref80","first-page":"3475","article-title":"Fast approximation of matrix coherence and statistical leverage","volume":"13","author":"Drineas","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"ref83","article-title":"Coding theory and randomized sketching for distributed optimization","author":"Charalambides","year":"2023"},{"key":"ref84","article-title":"Fast low-rank tensor decomposition by ridge leverage score sampling","author":"Fahrbach","year":"2021","journal-title":"arXiv:2107.10654"},{"key":"ref85","first-page":"24299","article-title":"Fast and accurate randomized algorithms for low-rank tensor decompositions","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"34","author":"Ma"},{"key":"ref86","first-page":"23933","article-title":"Leverage score sampling for tensor product matrices in input sparsity time","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Woodruff"},{"key":"ref87","article-title":"Matrix completion with noise via leveraged sampling","author":"Huang","year":"2020","journal-title":"arXiv:2011.05885"},{"key":"ref88","first-page":"1","article-title":"Fast randomized kernel ridge regression with statistical guarantees","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Alaoui"},{"key":"ref89","first-page":"153","article-title":"Unsupervised feature selection for the k-means clustering problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Boutsidis"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref91","first-page":"1","article-title":"Recursive sampling for the Nystrom method","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Musco"},{"issue":"22","key":"ref92","first-page":"1","article-title":"LSAR: Efficient leverage score sampling algorithm for the analysis of big time series data","volume":"23","author":"Eshragh","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746541"},{"key":"ref94","first-page":"3821","article-title":"An information-theoretic justification for model pruning","volume-title":"Proc. Int. Conf. Artif. Intell. Stat. (AISTATS 2022)","author":"Isik"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109682"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref98","first-page":"7861","article-title":"Oblivious sketching for logistic regression","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Munteanu"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688113"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref102","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"Rakhlin","year":"2011","journal-title":"arXiv:1109.5647"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"issue":"1","key":"ref104","first-page":"1","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"Dekel","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919767"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3122873"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3166902"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.01.004"},{"key":"ref111","article-title":"Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures","author":"Balabanov","year":"2022","journal-title":"arXiv:2210.11295"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10642977\/10576059-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10642977\/10576059.pdf?arnumber=10576059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T04:14:26Z","timestamp":1725164066000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10576059\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":111,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3420222","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]}}}