Computer Science – Artificial Intelligence
Scientific paper
2009-06-10
Computer Science
Artificial Intelligence
9 pages, to appear in the Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI-2009)
Scientific paper
We present a theoretical analysis of Maximum a Posteriori (MAP) sequence estimation for binary symmetric hidden Markov processes. We reduce the MAP estimation to the energy minimization of an appropriately defined Ising spin model, and focus on the performance of MAP as characterized by its accuracy and the number of solutions corresponding to a typical observed sequence. It is shown that for a finite range of sufficiently low noise levels, the solution is uniquely related to the observed sequence, while the accuracy degrades linearly with increasing the noise strength. For intermediate noise values, the accuracy is nearly noise-independent, but now there are exponentially many solutions to the estimation problem, which is reflected in non-zero ground-state entropy for the Ising model. Finally, for even larger noise intensities, the number of solutions reduces again, but the accuracy is poor. It is shown that these regimes are different thermodynamic phases of the Ising model that are related to each other via first-order phase transitions.
Allahverdyan Armen
Galstyan Aram
No associations
LandOfFree
On Maximum a Posteriori Estimation of Hidden Markov Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Maximum a Posteriori Estimation of Hidden Markov Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Maximum a Posteriori Estimation of Hidden Markov Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-207559