{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T13:04:28Z","timestamp":1769778268586,"version":"3.49.0"},"reference-count":34,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF2010219"],"award-info":[{"award-number":["W911NF2010219"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142412673"],"award-info":[{"award-number":["N000142412673"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF"},{"DOI":"10.13039\/100005595","name":"University of California (UC) Noyce Initiative","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3656634","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T21:11:10Z","timestamp":1769029870000},"page":"13070-13086","source":"Crossref","is-referenced-by-count":0,"title":["Measurement Manipulation of the Matrix Sensing Problem to Improve Optimization Landscape"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2894-0158","authenticated-orcid":false,"given":"Ying","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4294-1338","authenticated-orcid":false,"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"27369","article-title":"General low-rank matrix optimization: Geometric analysis and sharper bounds","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref2","first-page":"2","article-title":"Algorithmic regularization in over-parameterized matrix sensing and neural networks with quadratic activations","volume-title":"Proc. 31st Conf. Learn. Theory","author":"Li"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2000000033"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2016.2602099"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2528948"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.106.100401"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS39084.2020.9323509"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3241123"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01363-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0540-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/110820361"},{"key":"ref15","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Ge"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref17","article-title":"How much restricted isometry is needed in nonconvex matrix recovery?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Zhang"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26270"},{"key":"ref19","first-page":"3880","article-title":"Global optimality of local search for low rank matrix recovery","volume-title":"Proc. 30th Int. Conf. Neural Inf. Process. Syst.","volume":"29","author":"Bhojanapalli"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref21","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Zheng"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/22m1506456"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21252"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2016.1435"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2009.2039170"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.3043065"},{"key":"ref28","first-page":"39994","article-title":"Algorithmic regularization in tensor optimization: Towards a lifted approach in matrix sensing","volume-title":"Proc. Conf. Neural Inf. Process. Syst.","volume":"36","author":"Ma"},{"key":"ref29","first-page":"1603","article-title":"Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Ma"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"issue":"5","key":"ref31","first-page":"592","article-title":"How to generate random matrices from the classical compact groups","volume":"54","author":"Mezzadri","year":"2007","journal-title":"Notices Amer. Math. Soc."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/9781108303453"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2020.107765"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/11323511\/11359630-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11359630.pdf?arnumber=11359630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:25:47Z","timestamp":1769721947000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359630\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3656634","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}