Pages that link to "Item:Q2174980"
From MaRDI portal
The following pages link to A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (Q2174980):
Displaying 11 items.
- Using SVD for Topic Modeling (Q144914) (← links)
- Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculations (Q2112814) (← links)
- A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (Q2174980) (← links)
- Adaptive estimation in structured factor models with applications to overlapping clustering (Q2215724) (← links)
- Optimal Bayesian estimation of Gaussian mixtures with growing number of components (Q2692528) (← links)
- Detecting approximate replicate components of a high-dimensional random vector with latent structure (Q2692538) (← links)
- Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets (Q5073629) (← links)
- (Q5149229) (← links)
- Assigning topics to documents by successive projections (Q6183768) (← links)
- Special invited paper: the SCORE normalization, especially for heterogeneous network and text data (Q6548783) (← links)
- Robust machine learning algorithms for text analysis (Q6646164) (← links)
