{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T23:01:06Z","timestamp":1773010866302,"version":"3.50.1"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T00:00:00Z","timestamp":1522022400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1453261"],"award-info":[{"award-number":["1453261"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2018,3,26]]},"DOI":"10.1145\/3186262","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T12:06:45Z","timestamp":1522152405000},"page":"85-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Learning topic models -- provably and efficiently"],"prefix":"10.1145","volume":"61","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Ge","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoni","family":"Halpern","sequence":"additional","affiliation":[{"name":"Google, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mimno","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankur","family":"Moitra","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sontag","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Zhu","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,3,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124312"},{"key":"e_1_2_1_2_1","volume-title":"NIPS","author":"Anandkumar A.","year":"2012","unstructured":"Anandkumar , A. , Foster , D. , Hsu , D. , Kakade , S. , Liu , Y. Two SVDs suffice: Spectral decompositions for probabilistic topic modeling and latent dirichlet allocation . In NIPS ( 2012 ). Anandkumar, A., Foster, D., Hsu, D., Kakade, S., Liu, Y. Two SVDs suffice: Spectral decompositions for probabilistic topic modeling and latent dirichlet allocation. In NIPS (2012)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.49"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Blei D. Lafferty J. A correlated topic model of science. Ann. Appl. Stat. (2007) 17--35.  Blei D. Lafferty J. A correlated topic model of science. Ann. Appl. Stat. (2007) 17--35.","DOI":"10.1214\/07-AOAS114"},{"key":"e_1_2_1_7_1","first-page":"993","author":"Blei D.","year":"2003","unstructured":"Blei , D. , Ng , A. , Jordan , M. Latent dirichlet allocation. J. Mach. Learn. Res. ( 2003 ), 993 -- 1022 . Preliminary version in NIPS 2001. Blei, D., Ng, A., Jordan, M. Latent dirichlet allocation. J. Mach. Learn. Res. (2003), 993--1022. Preliminary version in NIPS 2001.","journal-title":"J. Mach. Learn. Res. ("},{"key":"e_1_2_1_8_1","volume-title":"Indexing by latent semantic analysis. JASIS","author":"Deerwester S.","year":"1990","unstructured":"Deerwester , S. , Dumais , S. , Landauer , T. , Furnas , G. , Harshman , R. Indexing by latent semantic analysis. JASIS ( 1990 ), 391--407. Deerwester, S., Dumais, S., Landauer, T., Furnas, G., Harshman, R. Indexing by latent semantic analysis. JASIS (1990), 391--407."},{"key":"e_1_2_1_9_1","first-page":"1","author":"Dempster A.P.","year":"1977","unstructured":"Dempster , A.P. , Laird , N.M. , Rubin , D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B ( 1977 ), 1 -- 38 . Dempster, A.P., Laird, N.M., Rubin, D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B (1977), 1--38.","journal-title":"J. Roy. Statist. Soc. Ser. B ("},{"key":"e_1_2_1_10_1","volume-title":"Efficient distributed topic modeling with provable guarantees. JMLR","author":"Ding W.","year":"2014","unstructured":"Ding , W. , Rohban , M.H. , Ishwar , P. , Saligrama , V. Efficient distributed topic modeling with provable guarantees. JMLR ( 2014 ), 167--175. Ding, W., Rohban, M.H., Ishwar, P., Saligrama, V. Efficient distributed topic modeling with provable guarantees. JMLR (2014), 167--175."},{"key":"e_1_2_1_11_1","volume-title":"When does non-negative matrix factorization give the correct decomposition into parts? In NIPS","author":"Donoho D.","year":"2003","unstructured":"Donoho , D. , Stodden , V. When does non-negative matrix factorization give the correct decomposition into parts? In NIPS ( 2003 ). Donoho, D., Stodden, V. When does non-negative matrix factorization give the correct decomposition into parts? In NIPS (2003)."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of The 32nd International Conference on Machine Learning","author":"Ge R.","year":"2015","unstructured":"Ge , R. , Zou , J. Intersecting faces : Non-negative matrix factorization with new guarantees . In Proceedings of The 32nd International Conference on Machine Learning ( 2015 ), 2295--2303. Ge, R., Zou, J. Intersecting faces: Non-negative matrix factorization with new guarantees. In Proceedings of The 32nd International Conference on Machine Learning (2015), 2295--2303."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"e_1_2_1_14_1","volume-title":"18th International Conference on Artificial Intelligence and Statistics","author":"Hoffman M.D.","year":"2015","unstructured":"Hoffman , M.D. , Blei , D.M. Structured stochastic variational inference . In 18th International Conference on Artificial Intelligence and Statistics ( 2015 ). Hoffman, M.D., Blei, D.M. Structured stochastic variational inference. In 18th International Conference on Artificial Intelligence and Statistics (2015)."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076450.2076474"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"e_1_2_1_17_1","volume-title":"NIPS","author":"Lee M.","year":"2015","unstructured":"Lee , M. , Bindel , D. , Mimno , D.M. Robust spectral inference for joint stochastic matrix factorization . In NIPS ( 2015 ). Lee, M., Bindel, D., Mimno, D.M. Robust spectral inference for joint stochastic matrix factorization. In NIPS (2015)."},{"key":"e_1_2_1_18_1","volume-title":"EMNLP","author":"Lee M.","year":"2014","unstructured":"Lee , M. , Mimno , D. Low-dimensional embeddings for interpretable anchor-based topic inference . In EMNLP ( 2014 ). Lee, M., Mimno, D. Low-dimensional embeddings for interpretable anchor-based topic inference. In EMNLP (2014)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143917"},{"key":"e_1_2_1_20_1","volume-title":"Mallet: A machine learning for language toolkit","author":"McCallum A.","year":"2002","unstructured":"McCallum , A. Mallet: A machine learning for language toolkit ( 2002 ). http:\/\/mallet.cs.umass.edu. McCallum, A. Mallet: A machine learning for language toolkit (2002). http:\/\/mallet.cs.umass.edu."},{"key":"e_1_2_1_21_1","volume-title":"EMNLP","author":"Mimno D.","year":"2011","unstructured":"Mimno , D. , Wallach , H. , Talley , E. , Leenders , M. , McCallum , A. Optimizing semantic coherence in topic models . In EMNLP ( 2011 ). Mimno, D., Wallach, H., Talley, E., Leenders, M., McCallum, A. Optimizing semantic coherence in topic models. In EMNLP (2011)."},{"key":"e_1_2_1_22_1","volume-title":"ACL","author":"Nguyen T.","year":"2014","unstructured":"Nguyen , T. , Hu , Y. , Boyd-Graber , J. Anchors regularized: Adding robustness and extensibility to scalable topic-modeling algorithms . In ACL ( 2014 ). Nguyen, T., Hu, Y., Boyd-Graber, J. Anchors regularized: Adding robustness and extensibility to scalable topic-modeling algorithms. In ACL (2014)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1894.0003"},{"key":"e_1_2_1_24_1","volume-title":"Data Science for Politics","author":"Roberts M.E.","year":"2014","unstructured":"Roberts , M.E. , Stewart , B.M. , Tingley , D. Navigating the local modes of big data: The case of topic models . In Data Science for Politics , Policy and Government (Cambridge University Press , New York , 2014 ). Roberts, M.E., Stewart, B.M., Tingley, D. Navigating the local modes of big data: The case of topic models. In Data Science for Politics, Policy and Government (Cambridge University Press, New York, 2014)."},{"key":"e_1_2_1_25_1","volume-title":"NIPS","author":"Sontag D.","year":"2011","unstructured":"Sontag , D. , Roy , D. Complexity of inference in latent dirichlet allocation . In NIPS ( 2011 ), 1008--1016. Sontag, D., Roy, D. Complexity of inference in latent dirichlet allocation. In NIPS (2011), 1008--1016."},{"key":"e_1_2_1_26_1","first-page":"1364","author":"Vavasis S.","year":"2009","unstructured":"Vavasis , S. On the complexity of nonnegative matrix factorization. SIAM J. Optim. ( 2009 ), 1364 -- 1377 . Vavasis, S. On the complexity of nonnegative matrix factorization. SIAM J. Optim. (2009), 1364--1377.","journal-title":"SIAM J. Optim. ("},{"key":"e_1_2_1_27_1","volume-title":"NIPS","author":"Zhou T.","year":"2014","unstructured":"Zhou , T. , Bilmes , J.A. , Guestrin , C. Divide-and-conquer learning by anchoring a conical hull . In NIPS ( 2014 ), 1242--1250. Zhou, T., Bilmes, J.A., Guestrin, C. Divide-and-conquer learning by anchoring a conical hull. In NIPS (2014), 1242--1250."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3186262","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3186262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:27Z","timestamp":1750212687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3186262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,26]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,3,26]]}},"alternative-id":["10.1145\/3186262"],"URL":"https:\/\/doi.org\/10.1145\/3186262","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,26]]},"assertion":[{"value":"2018-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}