A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models
Li Ying Xie, Valery Ugrinovskii, Ian R. Petersen · IEEE Transactions on Information Theory · 2007
In this correspondence, we consider a probability distance problem for a class of hidden Markov models (HMMs). The notion of conditional relative entropy between conditional probability measures is introduced as an a posteriori probability distance which can be used to measure the discrepancy between hidden Markov models when a realized observation sequence is observed. Using a measure change technique, we derive a representation for conditional relative entropy in terms of the parameters of the HMMs and conditional expectations given measurements. With this representation, we show that this distance can be calculated using an information state approach