{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:00:46Z","timestamp":1760598046490,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"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":["61872188","62073087","62071132","U191140003","6197309","61703209"],"award-info":[{"award-number":["61872188","62073087","62071132","U191140003","6197309","61703209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2020M672536"],"award-info":[{"award-number":["2020M672536"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020A1515010671","2019B010154002","2019B010118001"],"award-info":[{"award-number":["2020A1515010671","2019B010154002","2019B010118001"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JSPS KAKENHI","award":["20H04249"],"award-info":[{"award-number":["20H04249"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/jstsp.2021.3058763","type":"journal-article","created":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T02:17:06Z","timestamp":1613182626000},"page":"522-534","source":"Crossref","is-referenced-by-count":11,"title":["Tensor Recovery via $*_L$-Spectral $k$-Support Norm"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0412-2120","authenticated-orcid":false,"given":"Andong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1187-577X","authenticated-orcid":false,"given":"Guoxu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4293-0869","authenticated-orcid":false,"given":"Zhong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4442-3182","authenticated-orcid":false,"given":"Qibin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/347"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.10.030"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2012.12.007"},{"key":"ref31","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"boyd","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"ref37","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","first-page":"1331","article-title":"Convex tensor decomposition via structured schatten norm regularization","author":"tomioka","year":"2013"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TNNLS.2015.2496858","article-title":"Generalized higher order orthogonal iteration for tensor learning and decomposition","volume":"27","year":"2016","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"article-title":"Exact recovery of tensor robust principal component analysis under linear transforms","year":"2019","author":"lu","key":"ref10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2819892"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2299"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00861"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6074"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.07.021"},{"key":"ref15","first-page":"1457","article-title":"Sparse prediction with the $k$-support norm","author":"argyriou","year":"2012"},{"key":"ref16","first-page":"3644","article-title":"Spectral $k$-support norm regularization","author":"mcdonald","year":"2014"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref19","first-page":"1934","article-title":"Generalized dantzig selector: Application to the $k$-support norm","author":"chatterjee","year":"2014","journal-title":"Proc NIPS"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref27","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"},{"journal-title":"IEEE Trans Pattern Anal Mach Intell","article-title":"Tensor robust principal component analysis with a new tensor nuclear norm","year":"0","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00615"},{"article-title":"Tensor ring decomposition","year":"2016","author":"zhao","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"article-title":"Tensor $q$-rank: A new data dependent tensor rank","year":"2019","author":"kong","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2959980"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2946445"},{"key":"ref45","first-page":"3284","article-title":"Tight convex relaxations for sparse matrix factorization","author":"richard","year":"2014"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref22","first-page":"1180","article-title":"Unified view of matrix completion under general structural constraints","author":"gunasekar","year":"2015"},{"key":"ref47","first-page":"210","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"vershynin","year":"2010","journal-title":"Compressed Sensing Theory and Applications"},{"key":"ref21","first-page":"3252","article-title":"Structured matrix recovery via the generalized dantzig selector","author":"chen","year":"2016"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"2771","DOI":"10.1007\/s13042-020-01150-2","article-title":"A faster tensor robust PCA via tensor factorization","volume":"11","author":"wang","year":"2020","journal-title":"Int J Mach Learn Cybern"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2850324"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.07.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682643"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90407-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706975"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.11.012"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/9393360\/09353206.pdf?arnumber=9353206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:44Z","timestamp":1652194364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9353206\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":48,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2021.3058763","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"type":"print","value":"1932-4553"},{"type":"electronic","value":"1941-0484"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}