{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T16:43:05Z","timestamp":1791304985796,"version":"4.3.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1815101"],"award-info":[{"award-number":["CCF-1815101"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2115200"],"award-info":[{"award-number":["CCF-2115200"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1109\/tit.2022.3212374","type":"journal-article","created":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T19:37:09Z","timestamp":1664998629000},"page":"1177-1202","source":"Crossref","is-referenced-by-count":21,"title":["Fast and Sample-Efficient Federated Low Rank Matrix Recovery From Column-Wise Linear and Quadratic Projections"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3042-1186","authenticated-orcid":false,"given":"Seyedehsara","family":"Nayer","sequence":"first","affiliation":[{"name":"ASML, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2774-0650","authenticated-orcid":false,"given":"Namrata","family":"Vaswani","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2016.7551786"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2984478"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112805"},{"key":"ref7","first-page":"10101","article-title":"Decentralized sketching of low rank matrices","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Srinivasa"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NFSI-ICFBI.2007.4387720"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2010.2100850"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2017.11.003"},{"key":"ref11","first-page":"1341","article-title":"Memory and computation efficient PCA via very sparse random projections","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Anaraki"},{"key":"ref12","article-title":"Subspace learning from extremely compressed measurements","author":"Krishnamurthy","year":"2014","journal-title":"arXiv:1404.0751"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747549"},{"key":"ref14","first-page":"1007","article-title":"Fast exact matrix completion with finite samples","volume-title":"Proc. Conf. Learn. Theory","author":"Jain"},{"key":"ref15","first-page":"797","article-title":"Nearly optimal robust matrix completion","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Cherapanamjeri"},{"key":"ref16","first-page":"4159","article-title":"Fast algorithms for robust PCA via gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yi"},{"key":"ref17","article-title":"Convergence analysis for rectangular matrix completion using Burer\u2013Monteiro factorization and gradient descent","author":"Zheng","year":"2016","journal-title":"arXiv:1605.07051"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0897-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref20","first-page":"739","article-title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Chen"},{"issue":"1","key":"ref21","first-page":"5164","article-title":"A nonconvex approach for phase retrieval: Reshaped Wirtinger flow and incremental algorithms","volume":"18","author":"Zhang","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2019.2948758"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"ref25","first-page":"2861","article-title":"The noisy power method: A meta algorithm with applications","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Hardt"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000079"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2448516"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1443"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOP734"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10024105\/9912351-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10024105\/09912351.pdf?arnumber=9912351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:52:04Z","timestamp":1705963924000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9912351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3212374","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2]]}}}