{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:40:22Z","timestamp":1780548022178,"version":"3.54.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tit.2018.2841377","type":"journal-article","created":{"date-parts":[[2018,5,28]],"date-time":"2018-05-28T18:29:36Z","timestamp":1527532176000},"page":"7311-7338","source":"Crossref","is-referenced-by-count":131,"title":["Tensor SVD: Statistical and Computational Limits"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-5252","authenticated-orcid":false,"given":"Anru","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0834-3019","authenticated-orcid":false,"given":"Dong","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","author":"allen","year":"2012","journal-title":"Regularized tensor factorizations and higher-order principal components analysis"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12190"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.917929"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.910956"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.32"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2003.1211457"},{"key":"ref37","author":"anandkumar","year":"2014","journal-title":"Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-1 Updates"},{"key":"ref36","author":"anandkumar","year":"2016","journal-title":"Homotopy analysis for tensor PCA"},{"key":"ref35","first-page":"3106","article-title":"Interpolating convex and non-convex tensor decompositions via the subspace norm","author":"zheng","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","first-page":"1763","article-title":"Generalized higher-order orthogonal iteration for tensor decomposition and completion","author":"liu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240118X"},{"key":"ref62","author":"vershynin","year":"2010","journal-title":"Introduction to the Non-Asymptotic Analysis of Random Matrices"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"ref63","first-page":"1757","article-title":"Optimal estimation of low rank density matrices","volume":"16","author":"koltchinskii","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2005.05.019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015957395"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1541-0420.2010.01392.x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"ref20","first-page":"2239","article-title":"A tensor approach to learning mixed membership community models","volume":"15","author":"anandkumar","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref22","author":"liu","year":"2017","journal-title":"Characterizing spatiotemporal transcriptome of human brain via low rank tensor decomposition"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5651225"},{"key":"ref24","first-page":"956","article-title":"Tensor principal component analysis via sum-of-square proofs","author":"hopkins","year":"2015","journal-title":"Proc COLT"},{"key":"ref23","first-page":"2897","article-title":"A statistical model for tensor PCA","author":"montanari","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1541"},{"key":"ref25","author":"perry","year":"2016","journal-title":"Statistical limits of spiked tensor models"},{"key":"ref50","author":"cai","year":"2015","journal-title":"Computational and statistical boundaries for submatrix localization in a large noisy matrix"},{"key":"ref51","author":"chen","year":"2014","journal-title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00103-K"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0459-x"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488692"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100053056"},{"key":"ref53","first-page":"899","article-title":"Computational lower bounds for community detection on random graphs","author":"hajek","year":"2015","journal-title":"Proc COLT"},{"key":"ref52","first-page":"417","article-title":"Noisy tensor completion via the sum-of-squares hierarchy","author":"barak","year":"2016","journal-title":"Proc 29th Annu Conf Learn Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1178"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1014"},{"key":"ref40","first-page":"27","article-title":"Sparse higher-order principal components analysis","volume":"15","author":"allen","year":"2012","journal-title":"Proc 15th Int Conf Artif Intell Statist"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2013.776499"},{"key":"ref14","author":"zhang","year":"2016","journal-title":"Cross Efficient low-rank tensor completion"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864727"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718498"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TNN.2007.901277","article-title":"MPCA: Multilinear principal component analysis of tensor objects","volume":"19","author":"lu","year":"2008","journal-title":"IEEE Trans Neural Netw"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref19","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"anandkumar","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref4","first-page":"1","article-title":"Rate optimal denoising of simultaneously sparse and low rank matrices","volume":"17","author":"yang","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2013.858632"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2013.03.005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2270464"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2323359"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1257"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1300"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1127"},{"key":"ref45","author":"berthet","year":"2013","journal-title":"Computational Lower Bounds for Sparse PCA"},{"key":"ref48","author":"gao","year":"2014","journal-title":"Sparse CCA Adaptive estimation and computational barriers"},{"key":"ref47","author":"wang","year":"2014","journal-title":"Statistical and computational trade-offs in estimation of sparse principal components"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2532906"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006580"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8497120\/08368145.pdf?arnumber=8368145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:56:54Z","timestamp":1643223414000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8368145\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":65,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2841377","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}