{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:29:34Z","timestamp":1767846574144,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["CCF 0832797, AF 1218687, CCF 1302518, DMS-0835373"],"award-info":[{"award-number":["CCF 0832797, AF 1218687, CCF 1302518, DMS-0835373"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 0832797, AF 1218687, CCF 1302518, DMS-0835373"],"award-info":[{"award-number":["CCF 0832797, AF 1218687, CCF 1302518, DMS-0835373"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 0832797, AF 1218687, CCF 1302518, DMS-0835373"],"award-info":[{"award-number":["CCF 0832797, AF 1218687, CCF 1302518, DMS-0835373"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591881","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"594-603","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Smoothed analysis of tensor decompositions"],"prefix":"10.1145","author":[{"given":"Aditya","family":"Bhaskara","sequence":"first","affiliation":[{"name":"Google Research"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Ankur","family":"Moitra","sequence":"additional","affiliation":[{"name":"MIT"}]},{"given":"Aravindan","family":"Vijayaraghavan","sequence":"additional","affiliation":[{"name":"CMU"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS689"},{"key":"e_1_3_2_2_2_1","volume-title":"COLT","author":"Anandkumar A.","year":"2012","unstructured":"A. Anandkumar , D. Hsu and S. Kakade . A method of moments for mixture models and hidden Markov models . In COLT 2012 . A. Anandkumar, D. Hsu and S. Kakade. A method of moments for mixture models and hidden Markov models. In COLT 2012."},{"key":"e_1_3_2_2_3_1","volume-title":"COLT","author":"Anandkumar A.","year":"2013","unstructured":"A. Anandkumar , R. Ge , D. Hsu and S. Kakade . A Tensor Spectral Approach to Learning Mixed Membership Community Models . In COLT 2013 . A. Anandkumar, R. Ge, D. Hsu and S. Kakade. A Tensor Spectral Approach to Learning Mixed Membership Community Models. In COLT 2013."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA604494"},{"key":"e_1_3_2_2_5_1","first-page":"926","volume-title":"NIPS","author":"Anandkumar A.","year":"2012","unstructured":"A. Anandkumar , D. Foster , D. Hsu , S. Kakade , Y. Liu . A Spectral Algorithm for Latent Dirichlet Allocation . In NIPS , pages 926 -- 934 , 2012 . A. Anandkumar, D. Foster, D. Hsu, S. Kakade, Y. Liu. A Spectral Algorithm for Latent Dirichlet Allocation. In NIPS, pages 926--934, 2012."},{"key":"e_1_3_2_2_6_1","first-page":"2384","volume-title":"NIPS","author":"Arora S.","year":"2012","unstructured":"S. Arora , R. Ge , A. Moitra and S. Sachdeva . Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders . In NIPS , pages 2384 -- 2392 , 2012 . S. Arora, R. Ge, A. Moitra and S. Sachdeva. Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders. In NIPS, pages 2384--2392, 2012."},{"key":"e_1_3_2_2_7_1","volume-title":"Bling Signal Separation in the Presence of Gaussian Noise. In COLT","author":"Belkin M.","year":"2013","unstructured":"M. Belkin , L. Rademacher and J. Voss . Bling Signal Separation in the Presence of Gaussian Noise. In COLT 2013 . M. Belkin, L. Rademacher and J. Voss. Bling Signal Separation in the Presence of Gaussian Noise. In COLT 2013."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.16"},{"key":"e_1_3_2_2_9_1","volume-title":"Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. arxiv:1304.8087","author":"Bhaskara A.","year":"2013","unstructured":"A. Bhaskara , M. Charikar and A. Vijayaraghavan . Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. arxiv:1304.8087 , 2013 . A. Bhaskara, M. Charikar and A. Vijayaraghavan. Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability. arxiv:1304.8087, 2013."},{"key":"e_1_3_2_2_10_1","volume-title":"Smoothed Analysis of Tensor Decompositions. arxiv:1311.3651","author":"Bhaskara A.","year":"2013","unstructured":"A. Bhaskara , M. Charikar , A. Moitra and A. Vijayaraghavan . Smoothed Analysis of Tensor Decompositions. arxiv:1311.3651 , 2013 . A. Bhaskara, M. Charikar, A. Moitra and A. Vijayaraghavan. Smoothed Analysis of Tensor Decompositions. arxiv:1311.3651, 2013."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0025-5564(96)00075-2"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(94)90029-9"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796496"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.893943"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_5"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875529"},{"key":"e_1_3_2_2_17_1","volume-title":"STOC","author":"Goyal N.","year":"2014","unstructured":"N. Goyal , S. Vempala and Y. Xiao . Fourier PCA . In STOC , 2014 (this proceedings). N. Goyal, S. Vempala and Y. Xiao. Fourier PCA. In STOC, 2014 (this proceedings)."},{"key":"e_1_3_2_2_18_1","first-page":"1","volume-title":"UCLA Working Papers in Phonetics","author":"Harshman R.","year":"1970","unstructured":"R. Harshman . Foundations of the PARFAC procedure: model and conditions for an 'explanatory' multi-mode factor analysis . UCLA Working Papers in Phonetics , pages 1 -- 84 , 1970 . R. Harshman. Foundations of the PARFAC procedure: model and conditions for an 'explanatory' multi-mode factor analysis. UCLA Working Papers in Phonetics, pages 1--84, 1970."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"e_1_3_2_2_21_1","volume-title":"Matrix Analysis","author":"Horn R.","year":"1990","unstructured":"R. Horn and C. Johnson . Matrix Analysis . Cambridge University Press , 1990 . R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, 1990."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422439"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471221317"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806765"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748053"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(77)90069-6"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0614071"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/cbms\/1462106013"},{"key":"e_1_3_2_2_29_1","unstructured":"P. McCullagh. Tensor Methods in Statistics. Chapman and Hall\/CRC 1987.  P. McCullagh. Tensor Methods in Statistics . Chapman and Hall\/CRC 1987."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.15"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060645"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554818"},{"key":"e_1_3_2_2_33_1","first-page":"201","volume-title":"American Journal of Psychology","author":"Spearman C.","year":"1904","unstructured":"C. Spearman . General Intelligence. American Journal of Psychology , pages 201 -- 293 , 1904 . C. Spearman. General Intelligence. American Journal of Psychology, pages 201--293, 1904."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562785"},{"key":"e_1_3_2_2_36_1","first-page":"1276","volume-title":"Linear Algebra and Its Applications","author":"Stegeman A.","year":"2010","unstructured":"A. Stegeman and P. Comon . Subtracting a Best Rank-1 Approximation may Increase Tensor Rank . Linear Algebra and Its Applications , pages 1276 -- 1300 , 2010 . A. Stegeman and P. Comon. Subtracting a Best Rank-1 Approximation may Increase Tensor Rank. Linear Algebra and Its Applications, pages 1276--1300, 2010."},{"key":"e_1_3_2_2_37_1","first-page":"244","volume-title":"Identifiability of Mixtures. Annals of Mathematical Statistics","author":"Teicher H.","year":"1961","unstructured":"H. Teicher . Identifiability of Mixtures. Annals of Mathematical Statistics , pages 244 -- 248 , 1961 . H. Teicher. Identifiability of Mixtures. Annals of Mathematical Statistics, pages 244--248, 1961."},{"key":"e_1_3_2_2_38_1","volume-title":"Structure from Local Optima: Learning Subspace Juntas via Higher Order PCA. Arxiv:abs\/1108.3329","author":"Vempala S.","year":"2011","unstructured":"S. Vempala , Y. Xiao . Structure from Local Optima: Learning Subspace Juntas via Higher Order PCA. Arxiv:abs\/1108.3329 , 2011 . S. Vempala, Y. Xiao. Structure from Local Optima: Learning Subspace Juntas via Higher Order PCA. Arxiv:abs\/1108.3329, 2011."},{"key":"e_1_3_2_2_39_1","first-page":"99","article-title":"Perturbation Bounds","volume":"12","author":"Wedin P.","year":"1972","unstructured":"P. Wedin . Perturbation Bounds in Connection with Singular Value Decompositions. BIT , 12 : 99 -- 111 , 1972 . P. Wedin. Perturbation Bounds in Connection with Singular Value Decompositions. BIT, 12:99--111, 1972.","journal-title":"Connection with Singular Value Decompositions. BIT"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":39,"alternative-id":["10.1145\/2591796.2591881","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591881","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}