A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (Q2174980)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics |
scientific article |
Statements
A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (English)
0 references
27 April 2020
0 references
adaptive estimation
0 references
anchor words
0 references
high-dimensional estimation
0 references
identification
0 references
latent model
0 references
minimax estimation
0 references
nonnegative matrix factorization
0 references
overlapping clustering
0 references
separability
0 references
topic modeling
0 references
0 references
