A Simple Explanation of A Spectral Algorithm for Learning Hidden Markov\n Models

2012/04/11 by Matthew Johnson, Johnson, Matthew James
Computer Science · Decision Sciences · #Data Quality and Management #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Machine Learning and Algorithms #Methodology (stat.ME)

paper · pdf · doi:10.48550/arxiv.1204.2477

openalex publication_date 2012/04/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A simple linear algebraic explanation of the algorithm in "A Spectral\nAlgorithm for Learning Hidden Markov Models" (COLT 2009). Most of the content\nis in Figure 2; the text just makes everything precise in four nearly-trivial\nclaims.\n

Related

• Spectral dimensionality reduction for HMMs
• Equations for hidden Markov models
• Evaluation of Spectral Learning for the Identification of Hidden Markov Models
• Bridging the Usability Gap: Theoretical and Methodological Advances for Spectral Learning of Hidden Markov Models
• Supplement paper to "Online Expectation Maximization based algorithms for inference in hidden Markov models"