Learning Topic Models - Going beyond SVD

Topic Modeling is an approach used for automatic comprehension and classification of data in a variety of settings, and perhaps the canonical application is in uncovering thematic structure in a corpus of documents. A number of foundational works both in machine learning and in theory have suggested a probabilistic model for documents, whereby documents arise as a convex combination of (i.e. distribution on) a small number of topic vectors, each topic vector being a distribution on words (i.e. a vector of word-frequencies). Similar models have since been used in a variety of application areas, the Latent Dirichlet Allocation or LDA model of Blei et al. is especially popular. Theoretical studies of topic modeling focus on learning the model's parameters assuming the data is actually generated from it. Existing approaches for the most part rely on Singular Value Decomposition (SVD), and consequently have one of two limitations: these works need to either assume that each document contains only one topic, or else can only recover the {\em span} of the topic vectors instead of the topic vectors themselves. This paper formally justifies Nonnegative Matrix Factorization (NMF) as a main tool in this context, which is an analog of SVD where all vectors are nonnegative. Using this tool we give the first polynomial-time algorithm for learning topic models without the above two limitations. The algorithm uses a fairly mild assumption about the underlying topic matrix called separability, which is usually found to hold in real-life data. Perhaps the most attractive feature of our algorithm is that it generalizes to yet more realistic models that incorporate topic-topic correlations, such as the Correlated Topic Model (CTM) and the Pachinko Allocation Model (PAM). We hope that this paper will motivate further theoretical results that use NMF as a replacement for SVD -- just as NMF has come to replace SVD in many applications.

Maximum Likelihood fromIncomplete Data Via the…Maximum Likelihood from Incomplete Data Via the EM AlgorithmLearning the parts ofobjects by non-negative…Learning the parts of objects by non-negative matrix factorization10.1162/jmlr.2003.3.4-5.99310.1162/jmlr.2003.3.4-5.993Latent DirichletAllocationLatent Dirichlet AllocationWhen Does Non-NegativeMatrix Factorization…When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?Document clusteringbased on non-negative…Document clustering based on non-negative matrix factorizationNon-negative MatrixFactorization with…Non-negative Matrix Factorization with Sparseness ConstraintsA correlated topic modelof ScienceA correlated topic model of ScienceGraphical Models,Exponential Families…Graphical Models, Exponential Families, and Variational InferenceOn the Complexity ofNonnegative Matrix…On the Complexity of Nonnegative Matrix FactorizationComputing a NonnegativeMatrix Factorization -…Computing a Nonnegative Matrix Factorization - ProvablyTwo SVDs Suffice:Spectral decompositions…Two SVDs Suffice: Spectral decompositions for probabilistic topic modeling and latent Dirichlet allocationTensor decompositionsfor learning latent…Tensor decompositions for learning latent variable modelsFast Conical HullAlgorithms for…Fast Conical Hull Algorithms for Near-separable Non-negative Matrix FactorizationEllipsoidal rounding fornonnegative matrix…Ellipsoidal rounding for nonnegative matrix factorization under noisy separabilityRobust near-separablenonnegative matrix…Robust near-separable nonnegative matrix factorization using linear optimizationLow-dimensionalEmbeddings for…Low-dimensional Embeddings for Interpretable Anchor-based Topic InferenceUnderstanding theLimiting Factors of…Understanding the Limiting Factors of Topic Modeling via Posterior Contraction AnalysisAn analysis of thecoherence of descriptor…An analysis of the coherence of descriptors in topic modelingA Provably EfficientAlgorithm for Separable…A Provably Efficient Algorithm for Separable Topic DiscoverySpectral Learning forSupervised Topic ModelsSpectral Learning for Supervised Topic ModelsNonnegative MatrixFactorization for Signa…Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and ApplicationsState AggregationLearning from Markov…State Aggregation Learning from Markov Transition DataDeep NMF Topic ModelingDeep NMF Topic ModelingLearning Topic Models -Going beyond SVDLearning Topic Models - Going beyond SVD過去の参考文献中心の論文この論文を引用する論文古い新しい

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