A generalization of the Baum algorithm to rational objective functions
- 13 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The well-known Baum-Eagon (1967) inequality provides an effective iterative scheme for finding a local maximum for homogeneous polynomials with positive coefficients over a domain of probability values. However, in a large class of statistical problems, such as those arising in speech recognition based on hidden Markov models, it was found that estimation of parameters via some other criteria that use conditional likelihood, mutual information, or the recently introduced H-criteria can give better results than maximum-likelihood estimation. These problems require finding maxima for rational functions over domains of probability values, and an analog of the Baum-Eagon inequality for rational functions makes it possible to use an E-M (expectation-maximization) algorithm for maximizing these functions. The authors describe this extension.Keywords
This publication has 6 references indexed in Scilit:
- Maximum mutual information estimation of hidden Markov model parameters for speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Decoder selection based on cross-entropiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Maximum Likelihood Approach to Continuous Speech RecognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov ChainsThe Annals of Mathematical Statistics, 1970
- Growth transformations for functions on manifoldsPacific Journal of Mathematics, 1968
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecologyBulletin of the American Mathematical Society, 1967