{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:31:08Z","timestamp":1781713868028,"version":"3.54.5"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tit.2022.3223230","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:38:18Z","timestamp":1668717498000},"page":"2452-2484","source":"Crossref","is-referenced-by-count":6,"title":["Unique Sparse Decomposition of Low Rank Matrices"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7782-8824","authenticated-orcid":false,"given":"Dian","family":"Jin","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7462-9360","authenticated-orcid":false,"given":"Xin","family":"Bing","sequence":"additional","affiliation":[{"name":"Department of Statistical Sciences, University of Toronto, Toronto, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6080-9125","authenticated-orcid":false,"given":"Yuqian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Rutgers University, New Brunswick, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"8","article-title":"Exact recovery of sparsely used overcomplete dictionaries","volume":"1050","author":"Agarwal","year":"2013","journal-title":"Stat"},{"key":"ref2","first-page":"280","article-title":"A practical algorithm for topic modeling with provable guarantees","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","volume":"28","author":"Arora"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nature16468"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.2.141"},{"key":"ref5","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"2015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1877"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3150\/19-BEJ1166"},{"issue":"177","key":"ref8","first-page":"1","article-title":"Optimal estimation of sparse topic models","volume":"21","author":"Bing","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1304376110"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-14633-1"},{"key":"ref13","first-page":"1","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Donoho"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5796"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01579-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875421"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588294"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0712026105"},{"key":"ref21","first-page":"2007","article-title":"Structured low-rank matrix factorization: Optimality, algorithm, and applications to image processing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Haeffele"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/2333955"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1997.604766"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.7.1483"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(00)00026-5"},{"key":"ref26","first-page":"1724","article-title":"How to escape saddle points efficiently","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/joc.3370070506"},{"issue":"2","key":"ref28","first-page":"1","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"Journ\u00e9e","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/19m1237569"},{"key":"ref30","article-title":"Global geometry of multichannel sparse blind deconvolution on the sphere","author":"Li","year":"2018","journal-title":"arXiv: 1805.10437"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3934\/bdia.2016001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/15M101628X"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2601599"},{"key":"ref35","first-page":"1","article-title":"Geometric analysis of nonconvex optimization landscapes for overcomplete learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Qu"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054356"},{"key":"ref38","first-page":"1","article-title":"Exact recovery of sparsely-used dictionaries","volume-title":"Proc. Conf. Learn. Theory","author":"Spielman"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref41","first-page":"210","volume-title":"Introduction to the Non-Asymptotic Analysis of Random Matrices","author":"Roman","year":"2012"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3093769"},{"key":"ref43","first-page":"1","article-title":"Understanding \u21134-based dictionary learning: Interpretation, stability, and robustness","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhai"},{"issue":"165","key":"ref44","first-page":"1","article-title":"Complete dictionary learning via \u21134-norm maximization over the orthogonal group","volume":"21","author":"Zhai","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940657"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.466"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.120"},{"key":"ref48","article-title":"From symmetry to geometry: Tractable nonconvex problems","author":"Zhang","year":"2020","journal-title":"arXiv:2007.06753"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10073961\/09954420.pdf?arnumber=9954420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:55:15Z","timestamp":1706756115000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9954420\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":50,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3223230","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}