Algebraic Reduction of Hidden Markov Models
نویسندگان
چکیده
The problem of reducing a Hidden Markov Model (HMM) to one smaller dimension that exactly reproduces the same marginals is tackled by using system-theoretic approach. Realization theory tools are extended HMMs leveraging suitable algebraic representations probability spaces. We propose two algorithms return coarse-grained equivalent obtained stochastic projection operators: first returns models reproduce single-time distribution given output process, while in second full (multi-time) preserved. reduction method exploits not only structure observed output, but also its initial condition, whenever latter known or belongs subclass. Optimal derived for class HMM, namely observable ones.
منابع مشابه
Equivalence and Reduction of Hidden Markov Models Equivalence and Reduction of Hidden Markov Models
Hidden Markov Models are one of the most popular and successful techniques used in statistical pattern recognition. However, they are not well understood on a fundamental level. For example, we do not know how to characterize the class of processes that can be well approximated by HMMs. This thesis tries to uncover the source of the intrinsic expressiveness of HMMs by studying when and why two ...
متن کاملModel Reduction for Hidden Markov Models
The contribution of this thesis is the development of tractable computational methods for reducing the complexity of two classes of dynamical systems, finite alphabet Hidden Markov Models and Jump Linear Systems with finite parameter space. The reduction algorithms employ convex optimization and numerical linear algebra tools and do not pose any structural requirements on the systems at hand. I...
متن کاملReduction of Maximum Entropy Models to Hidden Markov Models
Maximum Entropy (maxent) models are an attractive formalism for statistical models of many types and have been used for a number of purposes, including language modeling (Rosenfeld 1994), part of speech tagging (Ratnaparkhi 1996), prepositional phrase attachment (Ratnaparkhi 1998), sentence breaking (Reynar and Ratnaparkhi 1997) and parsing (Ratnaparkhi 1997). Maxent models allow the combinatio...
متن کاملOptimal State-Space Reduction for Pedigree Hidden Markov Models
To analyze whole-genome genetic data inherited in families, the likelihood is typically obtained from a Hidden Markov Model (HMM) having a state space of 2 hidden states where n is the number of meioses or edges in the pedigree. There have been several attempts to speed up this calculation by reducing the state-space of the HMM. One of these methods has been automated in a calculation that is m...
متن کاملLumpable hidden Markov models-model reduction and reduced complexity filtering
This paper is concerned with filtering of hidden Markov processes (HMPs) which possess (or approximately possess) the property of lumpability. This property is a generalization of the property of lumpability of a Markov chain which has been previously addressed by others. In essence, the property of lumpability means that there is a partition of the (atomic) states of the Markov chain into aggr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2023
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2023.3279209