{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T07:01:52Z","timestamp":1790751712391,"version":"4.1.0"},"reference-count":37,"publisher":"Informa UK Limited","issue":"543","funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-2015259"],"award-info":[{"award-number":["DMS-2015259"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-2015378"],"award-info":[{"award-number":["DMS-2015378"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NIH","award":["R01-GM129781"],"award-info":[{"award-number":["R01-GM129781"]}]},{"name":"NIH","award":["R01-GM123056"],"award-info":[{"award-number":["R01-GM123056"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of the American Statistical Association"],"published-print":{"date-parts":[[2023,7,3]]},"DOI":"10.1080\/01621459.2021.2018329","type":"journal-article","created":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T11:01:40Z","timestamp":1640602900000},"page":"1849-1861","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":8,"title":["Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference"],"prefix":"10.1080","volume":"118","author":[{"given":"Ruijia","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Statistics and Data Science, University of Pennsylvania, Philadelphia, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8309-7164","authenticated-orcid":false,"given":"Linjun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Statistics, Rutgers University, New Brunswick, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Tony Cai","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, University of Pennsylvania, Philadelphia, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970398.2970409"},{"key":"e_1_3_3_3_1","first-page":"280","volume-title":"International Conference on Machine Learning","author":"Arora S.","year":"2013","unstructured":"Arora, S., Ge, R., Halpern, Y., Mimno, D., Moitra, A., Sontag, D., Wu, Y., and Zhu, M. (2013), \u201cA Practical Algorithm for Topic Modeling With Provable Guarantees,\u201d in International Conference on Machine Learning, pp. 280\u2013288. PMLR."},{"key":"e_1_3_3_4_1","unstructured":"Arora S. Ge R. Koehler F. Ma T. and Moitra A. (2016) \u201cProvable Algorithms for Inference in Topic Models \u201d in International Conference on Machine Learning PMLR pp. 2859\u20132867."},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.49"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.3150\/19-BEJ1166"},{"key":"e_1_3_3_7_1","first-page":"1","article-title":"\u201cOptimal Estimation of Sparse Topic Models","volume":"21","author":"Bing X.","year":"2020","unstructured":"Bing, X., Bunea, F., and Wegkamp, M. (2020b), \u201cOptimal Estimation of Sparse Topic Models,\u201d Journal of Machine Learning Research, 21, 1\u201345.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_8_1","first-page":"147","article-title":"\u201cCorrelated Topic Models,\u201d","volume":"18","author":"Blei D.","year":"2006","unstructured":"Blei, D., and Lafferty, J. (2006a), \u201cCorrelated Topic Models,\u201d Advances in Neural Information Processing Systems, 18, 147.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143859"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/jmlr.2003.3.4-5.993"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331888.2016.1265969"},{"key":"e_1_3_3_13_1","volume-title":"Spectral Graph Theory, Number 92","author":"Chung F. R.","year":"1997","unstructured":"Chung, F. R., and Graham, F. C. (1997), Spectral Graph Theory, Number 92, Providence, RI: American Mathematical Society."},{"key":"e_1_3_3_14_1","article-title":"Scenarionet: An Interpretable Data-Driven Model for Scene Understanding","author":"Daniels Z. A.","year":"2018","unstructured":"Daniels, Z. A., and Metaxas, D. (2018), \u201cScenarionet: An Interpretable Data-Driven Model for Scene Understanding,\u201d in IJCAI Workshop on XAI 2018.","journal-title":"IJCAI Workshop on XAI 2018"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_3_16_1","first-page":"1141","article-title":"When Does Non-Negative Matrix Factorization Give a Correct Decomposition Into Parts?","author":"Donoho D.","year":"2004","unstructured":"Donoho, D., and Stodden, V. (2004), \u201cWhen Does Non-Negative Matrix Factorization Give a Correct Decomposition Into Parts?\u201d in Advances in Neural Information Processing Systems, pp. 1141\u20131148.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_17_1","first-page":"4486","article-title":"\u201cState Aggregation Learning From Markov Transition Data","volume":"32","author":"Duan Y.","year":"2019","unstructured":"Duan, Y., Ke, T., and Wang, M. (2019), \u201cState Aggregation Learning From Markov Transition Data,\u201d Advances in Neural Information Processing Systems, 32, 4486\u20134495.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_3_3_20_1","first-page":"466","volume-title":"Advances in Neural Information Processing Systems","author":"Hofmann T.","year":"1999","unstructured":"Hofmann, T., Puzicha, J., and Jordan, M. I. (1999), \u201cLearning From Dyadic Data,\u201d in Advances in Neural Information Processing Systems, edited by M. Kearns, S. Solla, and D. Cohn, Denver, CO: NeurIPS pp. 466\u2013472."},{"key":"e_1_3_3_21_1","first-page":"2869","article-title":"\u201cConfidence Intervals and Hypothesis Testing for High-Dimensional Regression,\u201d","volume":"15","author":"Javanmard A.","year":"2014","unstructured":"Javanmard, A. and Montanari, A. (2014), \u201cConfidence Intervals and Hypothesis Testing for High-Dimensional Regression,\u201d The Journal of Machine Learning Research, 15, 2869\u20132909.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_3_22_1","article-title":"Estimating Network Memberships by Simplex Vertex Hunting","author":"Jin J.","year":"2017","unstructured":"Jin, J., Ke, Z. T., and Luo, S. (2017), \u201cEstimating Network Memberships by Simplex Vertex Hunting,\u201d arXiv:1708.07852.","journal-title":"arXiv:1708.07852"},{"key":"e_1_3_3_23_1","article-title":"A New SVD Approach to Optimal Topic Estimation","author":"Ke Z. T.","year":"2017","unstructured":"Ke, Z. T., and Wang, M. (2017), \u201cA New SVD Approach to Optimal Topic Estimation,\u201d arXiv: 1704.07016.","journal-title":"arXiv: 1704.07016"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1274"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.07.053"},{"key":"e_1_3_3_26_1","first-page":"2126","article-title":"\u201cOverlapping Clustering Models, and One (Class) SVM to Bind Them All","author":"Mao X.","year":"2018","unstructured":"Mao, X., Sarkar, P., and Chakrabarti, D. (2018), \u201cOverlapping Clustering Models, and One (Class) SVM to Bind Them All,\u201d in NeurIPS, pp. 2126\u20132136.","journal-title":"NeurIPS"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1214\/13-EJS818"},{"key":"e_1_3_3_28_1","first-page":"849","article-title":"\u201cOn Spectral Clustering: Analysis and an Algorithm,\u201d","volume":"14","author":"Ng A.","year":"2002","unstructured":"Ng, A., Jordan, M., and Weiss, Y. (2002), \u201cOn Spectral Clustering: Analysis and an Algorithm,\u201d Advances in Neural Information Processing Systems, 14, 849\u2013856.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007692713085"},{"key":"e_1_3_3_30_1","volume-title":"Introduction to Modern Information Retrieval","author":"Salton G.","year":"1983","unstructured":"Salton, G., and McGill, M. J. (1983), Introduction to Modern Information Retrieval, New York, NY: McGraw-Hill."},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/13-EJS868"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1221"},{"key":"e_1_3_3_33_1","article-title":"Cord-19: The Covid-19 Open Research Dataset","author":"Wang L. L.","year":"2020","unstructured":"Wang, L. L., Lo, K., Chandrasekhar, Y., Reas, R., Yang, J., Eide, D., Funk, K., Kinney, R., Liu, Z., Merrill, W. (2020), \u201cCord-19: The Covid-19 Open Research Dataset.\u201d arXiv:2004.10706.","journal-title":"arXiv:2004.10706"},{"key":"e_1_3_3_34_1","article-title":"Projection Onto the Probability Simplex: An Efficient Algorithm With a Simple Proof, and an Application","author":"Wang W.","year":"2013","unstructured":"Wang, W., and Carreira-Perpin\u00e1n, M. A. (2013), \u201cProjection Onto the Probability Simplex: An Efficient Algorithm With a Simple Proof, and an Application.\u201d arXiv:1309.1541.","journal-title":"arXiv:1309.1541"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860485"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0239441"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-017-9636-0"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12026"}],"container-title":["Journal of the American Statistical Association"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01621459.2021.2018329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T20:22:26Z","timestamp":1697142146000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01621459.2021.2018329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,31]]},"references-count":37,"journal-issue":{"issue":"543","published-print":{"date-parts":[[2023,7,3]]}},"alternative-id":["10.1080\/01621459.2021.2018329"],"URL":"https:\/\/doi.org\/10.1080\/01621459.2021.2018329","relation":{},"ISSN":["0162-1459","1537-274X"],"issn-type":[{"value":"0162-1459","type":"print"},{"value":"1537-274X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,31]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uasa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-12-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-29","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}