{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:47:36Z","timestamp":1740181656563,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF 19-43201"],"award-info":[{"award-number":["CCF 19-43201"]}],"id":[{"id":"10.13039\/100000001","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":[[2023]]},"DOI":"10.1109\/jsait.2023.3283973","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T17:43:58Z","timestamp":1686159838000},"page":"54-60","source":"Crossref","is-referenced-by-count":1,"title":["Sketching Low-Rank Matrices With a Shared Column Space by Convex Programming"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0862-9130","authenticated-orcid":false,"given":"Rakshith S.","family":"Srinivasa","sequence":"first","affiliation":[{"name":"Samsung Research America, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8833-8927","authenticated-orcid":false,"given":"Seonho","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1909-6041","authenticated-orcid":false,"given":"Kiryung","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Approximately low-rank recovery from noisy and local measurements by convex program","author":"lee","year":"2021","journal-title":"arXiv 2110 15205"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay018"},{"key":"ref15","first-page":"4762","article-title":"Phaseless PCA: Low-rank matrix recovery from column-wise phaseless measurements","author":"nayer","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2684758"},{"key":"ref20","volume":"176","author":"defant","year":"1992","journal-title":"Tensor Norms and Operator Ideals"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/052"},{"key":"ref2","first-page":"595","article-title":"Multi-level lasso for sparse multi-task regression","author":"lozano","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn (ICML)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SAM48682.2020.9104279"},{"key":"ref17","article-title":"Fast and sample-efficient federated low rank matrix recovery from column-wise linear and quadratic projections","author":"nayer","year":"2021","journal-title":"arXiv 2102 10217"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112805"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaaa018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref8","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2004","journal-title":"Proc 17th Int Conf Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/19M1242045"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MGRS.2013.2244672"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2016.7760276"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3070203"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/ic.2013.0235"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/18M1201068"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10153947\/10145920-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10153947\/10145920.pdf?arnumber=10145920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T19:09:14Z","timestamp":1707937754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10145920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/jsait.2023.3283973","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2023]]}}}