A Practical Algorithm for Topic Modeling with Provable Guarantees

Topic models provide a useful method for dimensionality reduction and exploratory data analysis in large text corpora. Most approaches to topic model inference have been based on a maximum likelihood objective. Efficient algorithms exist that approximate this objective, but they have no provable guarantees. Recently, algorithms have been introduced that provide provable bounds, but these algorithms are not practical because they are inefficient and not robust to violations of model assumptions. In this paper we present an algorithm for topic model inference that is both provable and practical. The algorithm produces results comparable to the best MCMC implementations while running orders of magnitude faster.

Perturbation bounds inconnection with singula…Perturbation bounds in connection with singular value decompositionIndexing by LatentSemantic AnalysisIndexing by Latent Semantic AnalysisExponentiated GradientVersus Gradient Descent…Exponentiated Gradient Versus Gradient Descent for Linear PredictorsLatent DirichletAllocationLatent Dirichlet AllocationEvaluation methods fortopic modelsEvaluation methods for topic modelsEfficient methods fortopic model inference o…Efficient methods for topic model inference on streaming document collectionsEstimating Likelihoodsfor Topic ModelsEstimating Likelihoods for Topic ModelsOptimizing SemanticCoherence in Topic…Optimizing Semantic Coherence in Topic ModelsExploring TopicCoherence over Many…Exploring Topic Coherence over Many Models and Many TopicsFast Conical HullAlgorithms for…Fast Conical Hull Algorithms for Near-separable Non-negative Matrix FactorizationRobustness Analysis ofHottTopixx, a Linear…Robustness Analysis of HottTopixx, a Linear Programming Model for Factoring Nonnegative MatricesNumerical optimizationNumerical optimizationLearning Linear BayesianNetworks with Latent…Learning Linear Bayesian Networks with Latent VariablesWhen are OvercompleteTopic Models…When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured SparsityLow-dimensionalEmbeddings for…Low-dimensional Embeddings for Interpretable Anchor-based Topic InferenceAn analysis of thecoherence of descriptor…An analysis of the coherence of descriptors in topic modelingSemidefinite ProgrammingBased Preconditioning…Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix FactorizationMost large topic modelsare approximately…Most large topic models are approximately separableA Fast Hyperplane-BasedMinimum-Volume Enclosin…A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral UnmixingMaximum Volume InscribedEllipsoid: A New…Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex OptimizationOn Identifiability ofNonnegative Matrix…On Identifiability of Nonnegative Matrix Factorizationstm: An R Package forStructural Topic Modelsstm: An R Package for Structural Topic ModelsNonnegative Blind SourceSeparation for…Nonnegative Blind Source Separation for Ill-Conditioned Mixtures via John EllipsoidA fast algorithm withminimax optimal…A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topicsA Practical Algorithmfor Topic Modeling with…A Practical Algorithm for Topic Modeling with Provable Guarantees過去の参考文献中心の論文この論文を引用する論文古い新しい

ノードをクリックするとフォーカスを固定、空白をクリックすると本論文に戻ります。ホバーで一時的にプレビューできます。各ノードのページはタイトルから開けます。