Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference
From MaRDI portal
Publication:6077578
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
- Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
- Confidence intervals for high-dimensional linear regression: minimax rates and adaptivity
- Confidence intervals for low dimensional parameters in high dimensional linear models
- Consistency of spectral clustering in stochastic block models
- scientific article; zbMATH DE number 3829300 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- On asymptotically optimal confidence regions and tests for high-dimensional models
- Optimal estimation of sparse topic models
- Sign-constrained least squares estimation for high-dimensional regression
- Signaling With Imperfect Channel State Information: A Battery Power Efficiency Comparison
- Text classification from labeled and unlabeled documents using EM
Cited in
(4)- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
- A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
- Learning Topic Models: Identifiability and Finite-Sample Analysis
- Estimation and inference for the Wasserstein distance between mixing measures in topic models
This page was built for publication: Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077578)
