Optimal estimation of sparse topic models
From MaRDI portal
Recommendations
- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
- Assigning topics to documents by successive projections
- Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculations
- Convergence rates of latent topic models under relaxed identifiability conditions
- A spectral algorithm for latent Dirichlet allocation
Cites work
Cited in
(10)- Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculations
- Low-rank regularization in two-sided matrix regression
- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
- Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference
- Learning Topic Models: Identifiability and Finite-Sample Analysis
- Assigning topics to documents by successive projections
- Learning topic hierarchies by tree-directed latent variable models
- Robust machine learning algorithms for text analysis
- Using SVD for Topic Modeling
- Detecting approximate replicate components of a high-dimensional random vector with latent structure
This page was built for publication: Optimal estimation of sparse topic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149229)
