{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T17:49:54Z","timestamp":1787161794877,"version":"build-2736575974"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","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":"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071380"],"award-info":[{"award-number":["12071380"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFB3101500"],"award-info":[{"award-number":["2021YFB3101500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1109\/tit.2022.3198725","type":"journal-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T15:58:50Z","timestamp":1660579130000},"page":"383-406","source":"Crossref","is-referenced-by-count":18,"title":["Tensor Robust Principal Component Analysis From Multilevel Quantized Observations"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5344-4460","authenticated-orcid":false,"given":"Jianjun","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Southwest University, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7539-8207","authenticated-orcid":false,"given":"Jingyao","family":"Hou","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Southwest University, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4358-5304","authenticated-orcid":false,"given":"Yonina C.","family":"Eldar","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref2","first-page":"1089","article-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Waters"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871475"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2019.2941271"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SustainIT.2013.6685194"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2549040"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2821648"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854548"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421187"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2495171"},{"issue":"60","key":"ref12","first-page":"1","article-title":"Probabilistic low-rank matrix completion from quantized measurements","volume":"17","author":"Bhaskar","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383813"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/15-EJS1093"},{"key":"ref15","first-page":"1727","article-title":"Probabilistic low-rank matrix completion on finite alphabets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"2","author":"Lafond"},{"key":"ref16","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"Cai","year":"2013","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"ref17","first-page":"1959","article-title":"Sparse factor analysis for learning and content analytics","volume":"15","author":"Lan","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.377"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTARS.2017.2779539"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.2986773"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23014-1_8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/03081088208817475"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.crme.2010.06.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3239"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2305840"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841377"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2022.2063131"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2061"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053151"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.2352\/ISSN.2470-1173.2018.13.IPAS-261"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2879031"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2865837"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3063527"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2021.02.032"},{"key":"ref45","first-page":"5778","article-title":"Tensor denoising and completion based on ordinal observations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2762595"},{"issue":"1","key":"ref47","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"Negahban","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref51","volume-title":"Probability in Banach Space: Isoperimetry and Processes","author":"Ledoux","year":"2013"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2234823"},{"issue":"5","key":"ref57","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/ab779b","article-title":"One-bit compressed sensing via \u2113p(0< p < 1)-minimization method","volume":"36","author":"Hou","year":"2020","journal-title":"Inverse Probl."},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2046811"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/110841229"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2022.3155949"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9997158\/09856701.pdf?arnumber=9856701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T00:07:12Z","timestamp":1709338032000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9856701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":62,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3198725","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]}}}