{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:11:35Z","timestamp":1768281095045,"version":"3.49.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["2217058"],"award-info":[{"award-number":["2217058"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tsp.2025.3614162","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T17:41:07Z","timestamp":1759340467000},"page":"13-26","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Hybrid Sketching for $\\ell_{2}$-Embeddings"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-1467","authenticated-orcid":false,"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[{"name":"Department of CSE and the Data Science Institute, University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4605-7996","authenticated-orcid":false,"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"Department of CSE and the Data Science Institute, University of California, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/isit57864.2024.10619537"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2842602"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/pcms\/025\/01"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.02.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585102"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375327"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2023.1271639"},{"key":"ref14","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref15","article-title":"Federated optimization: Distributed machine learning for on-device intelligence","author":"Kone\u010dn\u1ef3","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/icc45855.2022.9838986"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3356257"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834356"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3247559"},{"key":"ref21","first-page":"1564","article-title":"Block subsampled randomized Hadamard transform for Nystr\u00f6m approximation on distributed architectures","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","volume":"202","author":"Balabanov","year":"2023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3420222"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2020.2972887"},{"key":"ref24","article-title":"Randomized numerical linear algebra: A perspective on the field with an eye to software","author":"Murray","year":"2023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.21"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3186540"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3563450"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2924595"},{"key":"ref31","first-page":"18028","article-title":"Distributed Newton can communicate less and resist byzantine workers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Ghosh","year":"2020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2691662"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2659644"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2172430"},{"issue":"22","key":"ref35","first-page":"1","article-title":"LSAR: Efficient leverage score sampling algorithm for the analysis of big time series data","volume-title":"J. Mach. Learn. Res.","volume":"23","author":"Eshragh","year":"2022"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/9781108616799"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892124"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174299"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2421485"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2396477"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2781649"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref43","article-title":"Lecture notes on randomized linear algebra","author":"Mahoney","year":"2016"},{"key":"ref44","article-title":"A practical guide to randomized matrix computations with MATLAB implementations","author":"Wang","year":"2015"},{"key":"ref45","article-title":"Sketching algorithms","volume-title":"Lectures CS","volume":"170","author":"Nelson","year":"2020"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492920000021"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875220"},{"issue":"1","key":"ref49","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":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3384395"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/17m1111590"},{"issue":"1","key":"ref53","first-page":"861","article-title":"A statistical perspective on algorithmic leveraging","volume":"16","author":"Ma","year":"2015","journal-title":"J. Mach. Learn. Res."},{"issue":"Dec","key":"ref54","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":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref56","first-page":"17056","article-title":"Generalized leverage scores: Geometric interpretation and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ordozgoiti","year":"2022"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"ref60","first-page":"2835","article-title":"Newton-LESS: Sparsification without trade-offs for the sketched Newton update","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Derezinski","year":"2021"},{"key":"ref61","first-page":"1","article-title":"GIANT: Globally improved approximate newton method for distributed optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Wang","year":"2018"},{"key":"ref62","article-title":"UCI Machine Learning Repository","author":"Lichman","year":"2011"},{"key":"ref63","first-page":"6453","article-title":"Federated principal component analysis","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Grammenos","year":"2020"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/allerton58177.2023.10313492"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/11345506\/11186256.pdf?arnumber=11186256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:04:31Z","timestamp":1768255471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11186256\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":64,"URL":"https:\/\/doi.org\/10.1109\/tsp.2025.3614162","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}