Binary hidden Markov models and varieties
Andrew J. Critch

TL;DR
This paper develops algebraic tools for binary hidden Markov models, including a birational parametrization, a model membership test, and explicit defining equations, enhancing understanding and computational efficiency.
Contribution
It introduces a birational parametrization with an explicit inverse, a semialgebraic model membership test, and minimal defining equations for the 4-node binary HMM, advancing algebraic analysis of these models.
Findings
Explicit birational parametrization with inverse for binary HMMs.
Semialgebraic model membership test for binary HMMs.
Minimal defining equations for 4-node binary HMMs using Grobner bases.
Abstract
The technological applications of hidden Markov models have been extremely diverse and successful, including natural language processing, gesture recognition, gene sequencing, and Kalman filtering of physical measurements. HMMs are highly non-linear statistical models, and just as linear models are amenable to linear algebraic techniques, non-linear models are amenable to commutative algebra and algebraic geometry. This paper closely examines HMMs in which all the hidden random variables are binary. Its main contributions are (1) a birational parametrization for every such HMM, with an explicit inverse for recovering the hidden parameters in terms of observables, (2) a semialgebraic model membership test for every such HMM, and (3) minimal defining equations for the 4-node fully binary model, comprising 21 quadrics and 29 cubics, which were computed using Grobner bases in the cumulant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
