{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T08:24:46Z","timestamp":1744014286997,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":["12031016","12271327","12101384"],"award-info":[{"award-number":["12031016","12271327","12101384"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Research Program of Natural Science in Shaanxi Province","award":["2022JM-007","2020JQ-403","2021JQ-299"],"award-info":[{"award-number":["2022JM-007","2020JQ-403","2021JQ-299"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["GK202103001"],"award-info":[{"award-number":["GK202103001"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3427136","type":"journal-article","created":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T17:47:46Z","timestamp":1720806466000},"page":"3487-3501","source":"Crossref","is-referenced-by-count":1,"title":["1-Bit Tensor Completion via Max-and-Nuclear-Norm Composite Optimization"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0849-9419","authenticated-orcid":false,"given":"Wenfei","family":"Cao","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Shaanxi Normal University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6263-4792","authenticated-orcid":false,"given":"Xia","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shaanxi Normal University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0493-6222","authenticated-orcid":false,"given":"Shoucheng","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shaanxi Normal University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7431-7188","authenticated-orcid":false,"given":"Zeyue","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shaanxi Normal University, Xi’an, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8364-7226","authenticated-orcid":false,"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[{"name":"Systems Research Institute of Polish Academy of Science, Warsaw, Poland"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1659"},{"key":"ref2","first-page":"809","article-title":"A three-way model for collective learning on multi-relational data","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"11","author":"Nickel","year":"2011"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/ng.3624"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3098637"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2022.3179275"},{"article-title":"Entrywise tensor-train approximation of large tensors via random embeddings","year":"2024","author":"Budzinskiy","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"article-title":"Tensor ring decomposition","year":"2016","author":"Zhao","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2305840"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.07.021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2299"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.3000349"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3104837"},{"key":"ref20","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","volume-title":"Proc. 31st Int. Conf. Mach. Learn.","volume":"32","author":"Mu","year":"2014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-022-01937-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2872583"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/abd85b"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3051650"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/21M1429539"},{"issue":"63","key":"ref26","first-page":"1","article-title":"Fundamental conditions for low-CP-rank tensor completion","volume":"18","author":"Ashraphijuo","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841377"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2762595"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2959980"},{"issue":"1","key":"ref30","first-page":"5365","article-title":"Provable tensor-train format tensor completion by Riemannian optimization","volume":"23","author":"Cai","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3181378"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2520"},{"article-title":"Tensor completion via tensor train based low-rank quotient geometry under a preconditioned metric","year":"2023","author":"Cai","key":"ref33"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.sctalk.2024.100342"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2423694"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2923240"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2021.3062195"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2851612"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3266841"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-022-02009-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/22M1531907"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3254156"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.2352\/ISSN.2470-1173.2018.13.IPAS-261"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2879031"},{"article-title":"Near-optimal sample complexity for noisy or 1-bit tensor completion","year":"2018","author":"Ghadermarzy","key":"ref45"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2865837"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2021.02.032"},{"issue":"154","key":"ref48","first-page":"1","article-title":"Learning from binary multiway data: Probabilistic tensor decomposition and its statistical optimality","volume":"21","author":"Wang","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref49","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."},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1159-y"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3039308"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-2160-5"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2023.03.007"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1214\/15-EJS1093"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830000420X"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0078-2"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/18M1212525"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23014-1_8"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2022.3155949"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10347386\/10596996.pdf?arnumber=10596996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T18:32:18Z","timestamp":1722969138000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10596996\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3427136","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2024]]}}}