{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:27:22Z","timestamp":1768073242220,"version":"3.49.0"},"reference-count":90,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Semiconductor Research Corporation (SRC), National Science Foundation","award":["NSF-2246157"],"award-info":[{"award-number":["NSF-2246157"]}]},{"name":"Semiconductor Research Corporation (SRC), National Science Foundation","award":["ECCS-2037304"],"award-info":[{"award-number":["ECCS-2037304"]}]},{"name":"Semiconductor Research Corporation (SRC), National Science Foundation","award":["DMS-2134248"],"award-info":[{"award-number":["DMS-2134248"]}]},{"name":"SF CAREER Award","award":["CCF-2236829"],"award-info":[{"award-number":["CCF-2236829"]}]},{"DOI":"10.13039\/100000183","name":"U.S. Army Research Office","doi-asserted-by":"publisher","award":["W911NF-23-1-0343"],"award-info":[{"award-number":["W911NF-23-1-0343"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S. ARO Early Career Award","award":["W911NF-21-1-0242"],"award-info":[{"award-number":["W911NF-21-1-0242"]}]},{"DOI":"10.13039\/100000015","name":"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 J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/jsait.2024.3384395","type":"journal-article","created":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T19:55:39Z","timestamp":1712692539000},"page":"148-161","source":"Crossref","is-referenced-by-count":4,"title":["Iterative Sketching for Secure Coded Regression"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-1467","authenticated-orcid":false,"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[{"name":"Halicioğlu Data Science Institute, University of California at San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9021-1992","authenticated-orcid":false,"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, 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 at Ann Arbor, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834356"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/065"},{"key":"ref3","article-title":"Sketching as a tool for numerical linear algebra","author":"Woodruff","year":"2014","journal-title":"arXiv:1411.4357"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2842602"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2927558"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref13","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Yu"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518056"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682895"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/icassp39728.2021.9413800"},{"key":"ref17","article-title":"Straggler robust distributed matrix inverse approximation","author":"Charalambides","year":"2020","journal-title":"arXiv:2003.02948"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3133791"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322412"},{"key":"ref20","article-title":"Generalized fractional repetition codes for binary coded computations","author":"Charalambides","year":"2024","journal-title":"arXiv:2109.10484"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206890"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3312233"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/120874540"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3247559"},{"key":"ref32","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755563"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174512"},{"key":"ref36","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ye"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3122873"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref39","article-title":"Approximate gradient coding via sparse random graphs","author":"Charles","year":"2017","journal-title":"arXiv:1711.06771"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3182943"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3100110"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437887"},{"key":"ref45","article-title":"ErasureHead: Distributed gradient descent without delays using approximate gradient coding","author":"Wang","year":"2019","journal-title":"arXiv:1901.09671"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849580"},{"key":"ref48","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","author":"Chen","year":"2018","journal-title":"arXiv:1803.09877"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054153"},{"issue":"1","key":"ref50","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":"ref51","first-page":"9725","article-title":"Optimal iterative sketching methods with the subsampled randomized Hadamard transform","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Lacotte"},{"key":"ref52","first-page":"1","article-title":"Compressed regression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"20","author":"Zhou"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"issue":"72","key":"ref54","first-page":"1","article-title":"Redundancy techniques for straggler mitigation in distributed optimization and learning","volume":"20","author":"Karakus","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437722"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206967"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849245"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813677"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2024.3384395"},{"key":"ref61","article-title":"Gradient coding through iterative block leverage score sampling","author":"Charalambides","year":"2023","journal-title":"arXiv:2308.03096"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1201\/b17668"},{"issue":"22","key":"ref63","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":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396365"},{"key":"ref65","article-title":"Block Krylov space methods for linear systems with multiple right-hand sides: An introduction","volume-title":"Modern Mathematical Models, Methods and Algorithms for Real World Systems","author":"Gutknecht","year":"2006"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.022"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-020-00895-9"},{"issue":"1","key":"ref68","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"Dekel","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref70","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"Rakhlin","year":"2011","journal-title":"arXiv:1109.5647"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10928-8_22"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109682"},{"key":"ref73","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":"ref74","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2020.1859382"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511623813.014"},{"key":"ref76","volume-title":"Statistics on Special Manifolds","author":"Chikuse","year":"2012"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378289"},{"key":"ref79","article-title":"New bounds for matrix multiplication: From alpha to omega","author":"Williams","year":"2023","journal-title":"arXiv:2307.07970"},{"key":"ref80","article-title":"A fully homomorphic encryption scheme","author":"Gentry","year":"2009"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2021.3053220"},{"issue":"3","key":"ref84","first-page":"5","article-title":"Hill cipher key generation algorithm by using orthogonal matrix","volume":"3","author":"Khan","year":"2015","journal-title":"Int. J. Innov. Sci. Mod. Eng"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2405-6"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2970-3"},{"key":"ref87","article-title":"Orthogonal matrix in cryptography","author":"Santana","year":"2014","journal-title":"arXiv:1401.5787"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1080\/23799927.2019.1645210"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.14419\/ijet.v7i4.10.20707"},{"key":"ref90","volume-title":"Machine Learning: A Probabilistic Perspective","author":"Murphy","year":"2012"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10461668\/10491592-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10461668\/10491592.pdf?arnumber=10491592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:04:00Z","timestamp":1736543040000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10491592\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":90,"URL":"https:\/\/doi.org\/10.1109\/jsait.2024.3384395","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}