%0 Journal Article %A P. Parikh, Ankur %A Song, Le %A P Xing, Eric %D 2011 %T A Spectral Algorithm for Latent Tree Graphical Models %U https://kilthub.cmu.edu/articles/journal_contribution/A_Spectral_Algorithm_for_Latent_Tree_Graphical_Models/6475433 %R 10.1184/R1/6475433.v1 %2 https://kilthub.cmu.edu/ndownloader/files/11906558 %K Machine Learning %X

Latent variable models are powerful tools for probabilistic modeling, and have been successfully applied to various domains, such as speech analysis and bioinformatics. However, parameter learning algorithms for latent variable models have predominantly relied on local search heuristics such as expectation maximization (EM). We propose a fast, local-minimum-free spectral algorithm for learning latent variable models with arbitrary tree topologies, and show that the joint distribution of the observed variables can be reconstructed from the marginals of triples of observed variables irrespective of the maximum degree of the tree. We demonstrate the performance of our spectral algorithm on synthetic and real datasets; for large training sizes, our algorithm performs comparable to or better than EM while being orders of magnitude faster.

%I Carnegie Mellon University