{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:19:42Z","timestamp":1787015982236,"version":"build-2736575974"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":2430,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"National Science Foundation Career award","award":["DMS-1454377"],"award-info":[{"award-number":["DMS-1454377"]}]},{"name":"National Science Foundation Career award","award":["DMS-1151692"],"award-info":[{"award-number":["DMS-1151692"]}]},{"name":"National Science Foundation Career award","award":["DMS-1418042"],"award-info":[{"award-number":["DMS-1418042"]}]},{"name":"National Science Foundation grants","award":["IIS 1546482-BIGDATA"],"award-info":[{"award-number":["IIS 1546482-BIGDATA"]}]},{"name":"National Science Foundation grants","award":["IIS1408910"],"award-info":[{"award-number":["IIS1408910"]}]},{"name":"National Science Foundation grants","award":["IIS1332109"],"award-info":[{"award-number":["IIS1332109"]}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01MH102339"],"award-info":[{"award-number":["R01MH102339"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01GM083084"],"award-info":[{"award-number":["R01GM083084"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6,1]]},"abstract":"<jats:title>Summary<\/jats:title>\n                  <jats:p>We propose a novel sparse tensor decomposition method, namely the tensor truncated power method, that incorporates variable selection in the estimation of decomposition components. The sparsity is achieved via an efficient truncation step embedded in the tensor power iteration. Our method applies to a broad family of high dimensional latent variable models, including high dimensional Gaussian mixtures and mixtures of sparse regressions. A thorough theoretical investigation is further conducted. In particular, we show that the final decomposition estimator is guaranteed to achieve a local statistical rate, and we further strengthen it to the global statistical rate by introducing a proper initialization procedure. In high dimensional regimes, the statistical rate obtained significantly improves those shown in the existing non-sparse decomposition methods. The empirical advantages of tensor truncated power are confirmed in extensive simulation results and two real applications of click-through rate prediction and high dimensional gene clustering.<\/jats:p>","DOI":"10.1111\/rssb.12190","type":"journal-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T11:59:18Z","timestamp":1466855958000},"page":"899-916","source":"Crossref","is-referenced-by-count":77,"title":["Provable Sparse Tensor Decomposition"],"prefix":"10.1093","volume":"79","author":[{"given":"Will Wei","family":"Sun","sequence":"first","affiliation":[{"name":"Yahoo Research , Sunnyvale , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junwei","family":"Lu","sequence":"additional","affiliation":[{"name":"Princeton University \u00a0 USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han","family":"Liu","sequence":"additional","affiliation":[{"name":"Princeton University \u00a0 USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guang","family":"Cheng","sequence":"additional","affiliation":[{"name":"Purdue University , West Lafayette , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2016,6,23]]},"reference":[{"key":"2023021801094959700_rssb12190-cit-0001","volume-title":"Proc. Int. Conf. Artificial Intelligence and Statistics","author":"Allen","year":"2012"},{"key":"2023021801094959700_rssb12190-cit-0002","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":"2023021801094959700_rssb12190-cit-0003","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":"2023021801094959700_rssb12190-cit-0004","volume-title":"Guaranteed non-orthogonal tensor decomposition via alternating rank-1 updates","author":"Anandkumar","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0005","volume-title":"Dictionary learning and tensor decomposition via the sum-of-squares method","author":"Barak","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0008","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1002\/cem.801","article-title":"A new efficient method for determining the number of components in parafac models","volume":"17","author":"Bro","year":"2003","journal-title":"J. Chemometr."},{"key":"2023021801094959700_rssb12190-cit-0009","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1088\/0266-5611\/23\/3\/008","article-title":"Sparsity and incoherence in compressive sampling","volume":"23","author":"Candes","year":"2007","journal-title":"Invrs. Prob."},{"key":"2023021801094959700_rssb12190-cit-0010","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02310791","article-title":"Analysis of individual differences in multidimensional scaling via an n-way generalization of \u2018Eckart\u2013Young\u2019 decomposition","volume":"35","author":"Carroll","year":"1970","journal-title":"Psychometrika"},{"key":"2023021801094959700_rssb12190-cit-0011","volume-title":"Proc. Int. Conf. Machine Learning","author":"Chaganty","year":"2013"},{"key":"2023021801094959700_rssb12190-cit-0012","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","article-title":"Rank-sparsity incoherence for matrix decomposition","volume":"21","author":"Chandrasekaran","year":"2012","journal-title":"SIAM J. Optimzn"},{"key":"2023021801094959700_rssb12190-cit-0013","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1137\/110859063","article-title":"On tensors, sparsity, and nonnegative factorizations","volume":"33","author":"Chi","year":"2012","journal-title":"SIAM J. Matrx Anal. Appl."},{"key":"2023021801094959700_rssb12190-cit-0014","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1137\/110829180","article-title":"On generic identifiability of 3-tensors of small rank","volume":"33","author":"Chiantini","year":"2012","journal-title":"SIAM J. Matrx Anal. Appl."},{"key":"2023021801094959700_rssb12190-cit-0018","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1109\/18.959265","article-title":"Uncertainty principles and ideal atomic decomposition","volume":"47","author":"Donoho","year":"2001","journal-title":"IEEE Trans. Inform. Theor."},{"key":"2023021801094959700_rssb12190-cit-0019","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","article-title":"Greedy function approximation: a gradient boosting machine","volume":"29","author":"Friedman","year":"2001","journal-title":"Ann. Statist."},{"key":"2023021801094959700_rssb12190-cit-0021","volume-title":"Advances in Neural Information Processing Systems","author":"Gu","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0022","volume-title":"Innovations in Theoretical Computer Science","author":"Hsu","year":"2013"},{"key":"2023021801094959700_rssb12190-cit-0024","volume-title":"Recommender Systems","author":"Karatzoglou","year":"2010"},{"key":"2023021801094959700_rssb12190-cit-0025","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-015-0895-0","article-title":"Numerical optimization for symmetric tensor decomposition","volume":"151","author":"Kolda","year":"2015","journal-title":"Math. Programmng"},{"key":"2023021801094959700_rssb12190-cit-0027","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev."},{"key":"2023021801094959700_rssb12190-cit-0028","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02293554","article-title":"More factors than subjects, tests and treatments: an indeterminacy theorem for canonical decomposition and individual differences scaling","volume":"41","author":"Kruskal","year":"1976","journal-title":"Psychometrika"},{"key":"2023021801094959700_rssb12190-cit-0029","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0024-3795(77)90069-6","article-title":"Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics","volume":"18","author":"Kruskal","year":"1977","journal-title":"Lin. Alg. Appl."},{"key":"2023021801094959700_rssb12190-cit-0030","doi-asserted-by":"crossref","first-page":"1324","DOI":"10.1137\/S0895479898346995","article-title":"On the best rank-1 and rank-(r1,r2,\u2026,rn) approximation of higher-order tensors","volume":"21","author":"Lathauwer","year":"2000","journal-title":"SIAM J. Matrx Anal. Appl."},{"key":"2023021801094959700_rssb12190-cit-0032","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.patcog.2011.05.015","article-title":"Sparse non-negative tensor factorization using columnwise coordinate descent","volume":"45","author":"Liu","year":"2012","journal-title":"Pattn Recogn"},{"key":"2023021801094959700_rssb12190-cit-0033","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","article-title":"Tensor completion for estimating missing values in visual data","volume":"35","author":"Liu","year":"2013","journal-title":"IEEE Trans. Pattn Anal. Mach. Intell."},{"key":"2023021801094959700_rssb12190-cit-0034","volume-title":"Advances in Neural Information Processing Systems","author":"Liu","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0036","doi-asserted-by":"crossref","first-page":"2112","DOI":"10.1162\/neco.2008.11-06-407","article-title":"Algorithms for sparse nonnegative Tucker decomposition","volume":"20","author":"Morup","year":"2008","journal-title":"Neurl Computn"},{"key":"2023021801094959700_rssb12190-cit-0038","volume-title":"Proc. Conf. Computer Vision and Pattern Recognition","author":"Peng","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0039","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1080\/10556788.2015.1009977","article-title":"Newton-based optimization for nonnegative tensor factorizations","volume":"30","author":"Plantenga","year":"2015","journal-title":"Optimzn Meth. Softwr."},{"key":"2023021801094959700_rssb12190-cit-0040","volume-title":"Proc. Int. Conf. Machine Learning (eds E. P. Xing and T. Jebara)","author":"Rai","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0041","volume-title":"Proc. Int. Conf. Web Search and Data Mining","author":"Rendle","year":"2010"},{"key":"2023021801094959700_rssb12190-cit-0042","volume-title":"Advances in Neural Information Processing Systems","author":"Romera-Paredes","year":"2013"},{"key":"2023021801094959700_rssb12190-cit-0044","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10994-013-5366-3","article-title":"Learning with tensors: a framework based on convex optimization and spectral regularization","volume":"93","author":"Signoretto","year":"2014","journal-title":"Mach. Learn."},{"key":"2023021801094959700_rssb12190-cit-0049","volume-title":"High dimensional expectation-maximization algorithm: statistical optimization and asymptotic normality","author":"Wang","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0050","first-page":"515","volume-title":"Biostatistics","author":"Witten","year":"2009"},{"key":"2023021801094959700_rssb12190-cit-0051","volume-title":"Bayesian conditional tensor factorizations for high-dimensional classification","author":"Yang","year":"2013"},{"key":"2023021801094959700_rssb12190-cit-0053","volume-title":"On tensor completion via nuclear norm minimization","author":"Yuan","year":"2014"},{"key":"2023021801094959700_rssb12190-cit-0054","first-page":"899","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"Yuan","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"2023021801094959700_rssb12190-cit-0055","volume-title":"Artificial Intelligence and Statistics","author":"Zhe","year":"2015"},{"key":"2023021801094959700_rssb12190-cit-0056","volume-title":"Proc. 33rd Int. Special Interest Group on Information Retrieval Conf. Research and Development in Information Retrieval","author":"Zheng","year":"2010"},{"key":"2023021801094959700_rssb12190-cit-0057","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1080\/01621459.2013.776499","article-title":"Tensor regression with applications in neuroimaging data analysis","volume":"108","author":"Zhou","year":"2013","journal-title":"J. Am. Statist. Ass."}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Frssb.12190","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Frssb.12190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/rssb.12190","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1111\/rssb.12190","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/api.wiley.com\/onlinelibrary\/chorus\/v1\/articles\/10.1111%2Frssb.12190","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/79\/3\/899\/49214835\/jrsssb_79_3_899.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/79\/3\/899\/49214835\/jrsssb_79_3_899.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T20:11:01Z","timestamp":1676664661000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/79\/3\/899\/7040659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,23]]},"references-count":40,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,6,23]]},"published-print":{"date-parts":[[2017,6,1]]}},"URL":"https:\/\/doi.org\/10.1111\/rssb.12190","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2017,6]]},"published":{"date-parts":[[2016,6,23]]}}}