{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T01:43:04Z","timestamp":1771897384203,"version":"3.50.1"},"reference-count":95,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100019065","name":"Sichuan Science and Technology Program","doi-asserted-by":"publisher","award":["2024ZYD0036"],"award-info":[{"award-number":["2024ZYD0036"]}],"id":[{"id":"10.13039\/501100019065","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Laboratory of Wireless Communication Foundation","award":["IFN20230204"],"award-info":[{"award-number":["IFN20230204"]}]},{"name":"Key Research Program of the Chinese Academy of Sciences","award":["XDA27010102"],"award-info":[{"award-number":["XDA27010102"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101592"],"award-info":[{"award-number":["12101592"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tit.2024.3509476","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T18:38:39Z","timestamp":1733164719000},"page":"1323-1361","source":"Crossref","is-referenced-by-count":1,"title":["Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5373-8515","authenticated-orcid":false,"given":"Zhuohang","family":"He","sequence":"first","affiliation":[{"name":"National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1263-5006","authenticated-orcid":false,"given":"Junjie","family":"Ma","sequence":"additional","affiliation":[{"name":"Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Institute of Computational Mathematics and Scientific\/Engineering Computing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0433-6535","authenticated-orcid":false,"given":"Xiaojun","family":"Yuan","sequence":"additional","affiliation":[{"name":"National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619299"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2942176"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472443"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257913"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2883607"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2514\/6.2024-3138"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853589"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2018.8450718"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963774"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.120"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080737587"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref14","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"Chen","year":"2015","journal-title":"arXiv:1509.03025"},{"key":"ref15","first-page":"797","article-title":"Nearly optimal robust matrix completion","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cherapanamjeri"},{"issue":"1","key":"ref16","first-page":"3101","article-title":"Robust PCA by manifold optimization","volume":"19","author":"Zhang","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref18","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"Lin","year":"2010","journal-title":"arXiv:1009.5055"},{"key":"ref19","first-page":"167","article-title":"Sparse and low-rank matrix decomposition via alternating direction methods","volume":"9","author":"Yuan","year":"2013","journal-title":"Pacific J. Optim."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref21","first-page":"600","article-title":"Low-rank and sparse structure pursuit via alternating minimization","volume-title":"Proc. Artif. Intell. Statist.","author":"Gu"},{"key":"ref22","first-page":"4152","article-title":"Fast algorithms for robust PCA via gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yi"},{"key":"ref23","first-page":"1097","article-title":"A unified framework for nonconvex low-rank plus sparse matrix recovery","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Zhang"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2066"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2401536"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2197748"},{"key":"ref28","article-title":"Variational algorithms for approximate Bayesian inference","author":"Beal","year":"2003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.12720\/jcm.8.9.600-611"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5347-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2016.12.005"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.02.057"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682785"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357776"},{"key":"ref35","article-title":"Unitary approximate message passing for matrix factorization","author":"Yuan","year":"2022","journal-title":"arXiv:2208.00422"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3044847"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042414"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-012-9176-9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat002"},{"key":"ref43","article-title":"A variational approach to stable principal component pursuit","author":"Aravkin","year":"2014","journal-title":"arXiv:1406.1089"},{"key":"ref44","first-page":"1089","article-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Waters"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/AVSS.2015.7301773"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2017.8309163"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2018.00014"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2018.8450742"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/17M1178346"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/15M101628X"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2876621"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2021.3055063"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref59","first-page":"397","article-title":"Approximate message passing with spectral initialization for generalized linear models","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mondelli"},{"key":"ref60","first-page":"917","article-title":"Low-rank matrix reconstruction and clustering via approximate message passing","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Matsushita"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2556702"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1705490115"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2556683"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay021"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2351822"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2653119"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2697978"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2944740"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916359"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2270464"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2017.11.006"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2653801"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1257"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2239356"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau005"},{"key":"ref77","first-page":"362","article-title":"Expectation propagation for approximate Bayesian inference","volume-title":"Proc. 17th Int. Conf. Uncertainty Artif. Intell.","author":"Minka"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(99)00291-5"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2414951"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176345632"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2323359"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2947058"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2006.09.006"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1070\/SM1967v001n04ABEH001994"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893254"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3307553"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2717585"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2008.2001404"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asu067"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/b76887"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1016\/s0304-0208(08)x7172-5"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994775"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10851774\/10772159.pdf?arnumber=10772159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:50:50Z","timestamp":1737697850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10772159\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":95,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3509476","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}