| Efficient Training Algorithms for HMMs Using Incremental Estimation (2007) | |||||||||||||||||
Abstract | |||||||||||||||||
| Typically, parameter estimation for a hidden Markov model (HMM) is performed using an expectation-maximization (EM) algorithm with the maximum-likelihood (ML) criterion. The EM algorithm is an iterative scheme which is well-defined and numerically stable, but convergence may require a large number of iterations. For speech recognition systems utilizing large amounts of training material, this results in long training times. This paper presents an incremental estimation approach to speed-up the training of HMMs without any loss of recognition performance. The algorithm selects a subset of data from the training set, updates the model parameters based on the subset, and then iterates the process until convergence of the parameters. The advantage of this approach is a substantial increase in the number of iterations of the EM algorithm per training token which leads to faster training. In order to achieve reliable estimation from a small fraction of the complete data set at each... | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||