{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:43Z","timestamp":1773378043210,"version":"3.50.1"},"reference-count":51,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834356","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"826-831","source":"Crossref","is-referenced-by-count":9,"title":["Orthonormal Sketches for Secure Coded Regression"],"prefix":"10.1109","author":[{"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[{"name":"University of Michigan,EECS Department"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"University of Michigan,EECS Department"}]},{"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Stanford University,EE Department"}]},{"given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[{"name":"University of Michigan,EECS Department"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Distributed sketching methods for privacy preserving regression","author":"bartan","year":"2020"},{"key":"ref38","article-title":"Optimal iterative sketching methods with the subsampled randomized hadamard transform","volume":"33","author":"lacotte","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989328"},{"key":"ref30","article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019"},{"key":"ref37","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":"The Journal of Machine Learning Research"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054153"},{"key":"ref35","article-title":"Draco: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849580"},{"key":"ref28","article-title":"Gradient coding via the stochastic block model","author":"charles","year":"2018"},{"key":"ref27","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2017"},{"key":"ref29","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/065"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834356"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref22","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755563"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref26","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174512"},{"key":"ref50","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"dekel","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1201\/b17668"},{"key":"ref10","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Adv in Neural Info Proc Systems (NIPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref40","article-title":"Compressed regression","volume":"20","author":"zhou","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref12","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018"},{"key":"ref13","article-title":"A locality-based approach for coded computation","author":"rudow","year":"2020"},{"key":"ref14","article-title":"Approximate Weighted CR-Coded Matrix Multiplication","author":"charalambides","year":"2020"},{"key":"ref15","article-title":"Straggler Robust Distributed Matrix Inverse Approximation","author":"charalambides","year":"2020"},{"key":"ref16","article-title":"Coded distributed computing with partial recovery","author":"ozfatura","year":"2020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322412"},{"key":"ref18","article-title":"Numerically stable binary coded computations","author":"charalambides","year":"2021"},{"key":"ref19","article-title":"Coded computing","volume":"17","author":"li","year":"2020","journal-title":"Foundations and Trends? in Communications and Information Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"ref3","article-title":"Sketching as a tool for numerical linear algebra","author":"woodruff","year":"2014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2842602"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref49","first-page":"360","article-title":"Block cur: Decomposing matrices using groups of columns","author":"oswal","year":"2018","journal-title":"Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref46","article-title":"Block krylov space methods for linear systems with multiple right-hand sides: an introduction","author":"gutknecht","year":"2006"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396365"},{"key":"ref48","first-page":"1","article-title":"On block gaussian sketching for the kaczmarz method","author":"rebrova","year":"2020","journal-title":"Numerical Algorithms"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.022"},{"key":"ref42","first-page":"1","article-title":"Redundancy techniques for straggler mitigation in distributed optimization and learning","volume":"20","author":"karakus","year":"2019","journal-title":"Journal of Machine Learning Research"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849245"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437722"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834356.pdf?arnumber=9834356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:01Z","timestamp":1773347761000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834356","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}