A theorem which shows that the local maximum found by the forward-backward algorithm in the case of discrete hidden Markov models is really local is presented. By this it is meant that this local maximum is restricted to lie in the same connected component of the set (x:P(x)
On the locality of the forward-backward algorithm (speech recognition)
IEEE transactions on speech and audio processing, Volume 1, n°2, April 1993
© 1993 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/87