A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
From MaRDI portal
Publication:2174980
DOI10.3150/19-BEJ1166zbMath1434.68396arXiv1805.06837OpenAlexW3018018008MaRDI QIDQ2174980
Florentina Bunea, Xin Bing, Marten H. Wegkamp
Publication date: 27 April 2020
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.06837
identificationseparabilityadaptive estimationminimax estimationnonnegative matrix factorizationoverlapping clusteringhigh-dimensional estimationtopic modelinglatent modelanchor words
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)
Related Items
Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets, 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, Assigning topics to documents by successive projections, Optimal Bayesian estimation of Gaussian mixtures with growing number of components, Detecting approximate replicate components of a high-dimensional random vector with latent structure, Adaptive estimation in structured factor models with applications to overlapping clustering, Using SVD for Topic Modeling, Unnamed Item, Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculations
Uses Software
Cites Work
