Local Equivalence Problem in Hidden Markov Model
Masahito Hayashi

TL;DR
This paper investigates the local equivalence problem in hidden Markov models by using geometric and algebraic methods to distinguish non-identifiable transition matrices.
Contribution
It introduces a mathematical framework to analyze the local equivalence of hidden Markov processes through geometric structures and generator parametrizations.
Findings
Formulated the equivalence problem as generator equivalence.
Derived concrete parametrizations for natural cases.
Provided a geometric approach to distinguish equivalent models.
Abstract
In the hidden Markov process, there is a possibility that two different transition matrices for hidden and observed variables yield the same stochastic behavior for the observed variables. Since such two transition matrices cannot be distinguished, we need to identify them and consider that they are equivalent, in practice. We address the equivalence problem of hidden Markov process in a local neighborhood by using the geometrical structure of hidden Markov process. For this aim, we introduce a mathematical concept to express Markov process, and formulate its exponential family by using generators. Then, the above equivalence problem is formulated as the equivalence problem of generators. Taking this equivalence problem into account, we derive several concrete parametrizations in several natural cases.
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.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Bayesian Modeling and Causal Inference · Bayesian Methods and Mixture Models
