English

Adjusted Viterbi training

Statistics Theory 2007-06-13 v2 Probability Statistics Theory

Abstract

We study modifications of the Viterbi Training (VT) algorithm to estimate emission parameters in Hidden Markov Models (HMM) in general, and in mixure models in particular. Motivated by applications of VT to HMM that are used in speech recognition, natural language modeling, image analysis, and bioinformatics, we investigate a possibility of alleviating the inconsistency of VT while controlling the amount of extra computations. Specifically, we propose to enable VT to asymptotically fix the true values of the parameters as does the EM algorithm. This relies on infinite Viterbi alignment and an associated with it limiting probability distribution. This paper, however, focuses on mixture models, an important case of HMM, wherein the limiting distribution can always be computed exactly; finding such limiting distribution for general HMM presents a more challenging task under our ongoing investigation. A simulation of a univariate Gaussian mixture shows that our central algorithm (VA1) can dramatically improve accuracy without much cost in computation time. We also present VA2, a more mathematically advanced correction to VT, verify by simulation its fast convergence and high accuracy; its computational feasibility remains to be investigated in future work.

Keywords

Cite

@article{arxiv.math/0406237,
  title  = {Adjusted Viterbi training},
  author = {J. Lember and A. Koloydenko},
  journal= {arXiv preprint arXiv:math/0406237},
  year   = {2007}
}

Comments

15 pages, 1 PostScript figure; in review by "Computational Statistics and Data Analysis"; citation 15 activated 20 pages, 1.5-spaced, citation styled changed to author-year, minor changes in the wording of abstract and introduction, three new references added, one old one removed, table references corrected, submitted to "Statistics and Computing"