A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (Q2174980)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7193942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics |
scientific article; zbMATH DE number 7193942 |
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
0.87115383
0 references
0 references
0.84745044
0 references
0.8447278
0 references
0.8434539
0 references
0.8397716
0 references
0.83115673
0 references
0.8280152
0 references
