{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T12:34:40Z","timestamp":1772886880927,"version":"3.50.1"},"reference-count":142,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Faculty Early Career Development Award sponsored by the University of California at Santa Barbara"},{"name":"Hellman Family Faculty Fellowship"},{"name":"NSF","award":["DMS-2111303"],"award-info":[{"award-number":["DMS-2111303"]}]},{"name":"NSF","award":["DMS-2340631"],"award-info":[{"award-number":["DMS-2340631"]}]},{"name":"Simons Fellowship"},{"name":"NSF","award":["1837991"],"award-info":[{"award-number":["1837991"]}]},{"name":"NSF","award":["1913243"],"award-info":[{"award-number":["1913243"]}]},{"name":"NSF","award":["1934979"],"award-info":[{"award-number":["1934979"]}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-20-1-0288"],"award-info":[{"award-number":["FA9550-20-1-0288"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-23-1-0445"],"award-info":[{"award-number":["FA9550-23-1-0445"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tit.2024.3413534","type":"journal-article","created":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T17:32:17Z","timestamp":1718386337000},"page":"6412-6446","source":"Crossref","is-referenced-by-count":1,"title":["Learning Transition Operators From Sparse Space-Time Samples"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9267-5379","authenticated-orcid":false,"given":"Christian","family":"K\u00fcmmerle","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of North Carolina at Charlotte, Charlotte, NC, USA"}]},{"given":"Mauro","family":"Maggioni","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3284-5123","authenticated-orcid":false,"given":"Sui","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California at Santa Barbara, Isla Vista, Santa Barbara, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2018.8439117"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2742940"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2827328"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2602809"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2731164"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2731051"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2890143"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2006.04.004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0500334102"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7906046"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/8476.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0022112010001217"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974508"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2020.2975393"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref21","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"11","author":"Mohan","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","first-page":"5872","article-title":"A scalable second order method for ill-conditioned matrix completion from few samples","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"K\u00fcmmerle"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2992769"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343623"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2629078"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/19M1305045"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/19M1244603"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496304700"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2019.1576176"},{"key":"ref33","article-title":"Matrix rank minimization with applications","author":"Fazel","year":"2002"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/21M1433812"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/100811404"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/sampta.2017.8024466"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/20M1315294"},{"key":"ref43","first-page":"2691","article-title":"Algebraic variety models for high-rank matrix completion","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Ongie"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323448"},{"issue":"94","key":"ref45","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"Chen","year":"2015","journal-title":"J. Mach. Learn. Res."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iax020"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.09.002"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.014"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960067"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2696019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-018-0224-8"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2019.05.066"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2016.10.027"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2021.108962"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BF03549595"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-016-9497-5"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ac37fb"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(70)90132-X"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1768-8_11"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2006.05.045"},{"key":"ref61","first-page":"60","article-title":"Learning partially observed linear dynamical systems from logarithmic number of samples","volume-title":"Proc. 3rd Conf. Learn. Dyn. Control","volume":"144","author":"Fattahi"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8814438"},{"key":"ref63","first-page":"5610","article-title":"Near optimal finite time identification of arbitrary linear dynamical systems","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Sarkar"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3042924"},{"key":"ref65","first-page":"16","article-title":"Finite sample system identification: Improved rates and the role of regularization","volume-title":"Proc. 2nd Conf. Learn. Dyn. Control","volume":"120","author":"Sun"},{"key":"ref66","article-title":"Non-asymptotic analysis of robust control from coarse-grained identification","author":"Tu","year":"2017","journal-title":"arXiv:1707.04791"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/130937913"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ab958e"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1524\/auto.1966.14.112.545"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1137\/110853996"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1137\/120883050"},{"key":"ref72","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-89620-5","volume-title":"Structured Low-Rank Approximation: Algorithms, Implementation, Applications","author":"Markovsky","year":"2019"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2813009"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/29\/2\/025001"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2757003"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2009.11.012"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/29.56027"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.12.003"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/29.32276"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2016.2601296"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.04.004"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/SampTA45681.2019.9030959"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2827299"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553041"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3191339"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1137\/22m1491009"},{"key":"ref87","first-page":"172","article-title":"Learning networks of stochastic differential equations","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"23","author":"Pereira"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2628343"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953413"},{"key":"ref90","first-page":"920","article-title":"How to learn a graph from smooth signals","volume-title":"Proc. 19th Int. Conf. Artif. Intell. Statist.","author":"Kalofolias"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2018.2872157"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(95)00501-3"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1007\/s11785-016-0596-6"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90269-G"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS876"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS637"},{"issue":"104","key":"ref97","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"Recht","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150189"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09429-9"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1137\/17M1141394"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1137\/151005099"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2511584"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2017.2721819"},{"key":"ref106","first-page":"21453","article-title":"A novel variational form of the Schatten-p quasi-norm","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Giampouras"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-020-09939-5"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1080\/03610927708827533"},{"key":"ref109","article-title":"Understanding and enhancing data recovery algorithms: From noise-blind sparse recovery to reweighted methods for low-rank matrix optimization","author":"K\u00fcmmerle","year":"2019"},{"key":"ref110","volume-title":"Optimal weight operators of spectral functions for fast low-rank optimization","author":"K\u00fcmmerle"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9046-4"},{"key":"ref112","first-page":"1638","article-title":"Universal low-rank matrix recovery from Pauli measurements","volume-title":"Proc. 24th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Liu"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2022.07.002"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/693\/13941"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1137\/16M1090004"},{"key":"ref117","first-page":"1396","article-title":"Randomized block Krylov methods for stronger and faster approximate singular value decomposition","volume-title":"Proc. NIPS","author":"Musco"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00193"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0560-5"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/092"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"ref123","article-title":"GSPBOX: A toolbox for signal processing on graphs","author":"Perraudin","year":"2014","journal-title":"arXiv:1408.5781"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.21105\/joss.01244"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2013.04.005"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0347-5"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"ref129","volume-title":"CVX: MATLAB Software for Disciplined Convex Programming, Version 2.2","author":"Grant","year":"2014"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2846643"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2020011"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.04.013"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/11.1.50"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1201\/9780429096280"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/006\/0084178"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718140"},{"key":"ref140","article-title":"Inverting modified matrices","author":"Woodbury","year":"1950"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref142","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971354","volume-title":"Fast Reliable Algorithms for Matrices With Structure","author":"Kailath","year":"1999"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10642977\/10558780-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10642977\/10558780.pdf?arnumber=10558780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T04:39:41Z","timestamp":1725079181000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10558780\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":142,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3413534","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]}}}