Learning Hidden Markov Models When the Locations of Missing Observations are Unknown
Binyamin Perets, Mark Kozdoba, Shie Mannor

TL;DR
This paper develops new algorithms for learning Hidden Markov Models from data with unknown missing observation locations, removing structural assumptions and improving reconstruction accuracy.
Contribution
It introduces general reconstruction algorithms for HMMs with unknown missing data positions, applicable without structural assumptions and with limited prior knowledge.
Findings
Algorithms achieve reconstruction accuracy comparable to known missing positions
Methods are robust under model misspecification
Applicable to a wide range of scenarios without structural constraints
Abstract
The Hidden Markov Model (HMM) is one of the most widely used statistical models for sequential data analysis. One of the key reasons for this versatility is the ability of HMM to deal with missing data. However, standard HMM learning algorithms rely crucially on the assumption that the positions of the missing observations \emph{within the observation sequence} are known. In the natural sciences, where this assumption is often violated, special variants of HMM, commonly known as Silent-state HMMs (SHMMs), are used. Despite their widespread use, these algorithms strongly rely on specific structural assumptions of the underlying chain, such as acyclicity, thus limiting the applicability of these methods. Moreover, even in the acyclic case, it has been shown that these methods can lead to poor reconstruction. In this paper we consider the general problem of learning an HMM from data with…
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
Taxonomy
TopicsFault Detection and Control Systems · Bayesian Modeling and Causal Inference · Machine Learning and Algorithms
