Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference

DOI10.1080/01621459.2021.2018329MaRDI QIDQ6077578

Ruijia Wu, Linjun Zhang, Unnamed Author

Publication date: 18 October 2023

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Sparse_Topic_Modeling_Computational_Efficiency_Near-Optimal_Algorithms_and_Statistical_Inference/17695307

zbMATH Keywords

confidence intervalsmatrix factorizationsparsityhigh-dimensional statisticstopic modeling

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (1)

A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On asymptotically optimal confidence regions and tests for high-dimensional models
• Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
• Text classification from labeled and unlabeled documents using EM
• Sign-constrained least squares estimation for high-dimensional regression
• Confidence intervals for high-dimensional linear regression: minimax rates and adaptivity
• A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
• Consistency of spectral clustering in stochastic block models
• Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
• Signaling With Imperfect Channel State Information: A Battery Power Efficiency Comparison
• 10.1162/jmlr.2003.3.4-5.993
• Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models

This page was built for publication: Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference