Optimal estimation of sparse topic models
From MaRDI portal
Publication:5149229
Authors: Xin Bing, Florentina Bunea, Marten H. Wegkamp 
Publication date: 8 February 2021
Full work available at URL: https://arxiv.org/abs/2001.07861
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
sparse estimationnon-negative matrix factorizationadaptive estimationseparabilityminimax estimationhigh dimensional estimationtopic modelsanchor words
Cites Work
Cited In (8)
- Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculations
- 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
- Robust machine learning algorithms for text analysis
- Detecting approximate replicate components of a high-dimensional random vector with latent structure
- Using SVD for Topic Modeling
Uses Software
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)
