Although having revealed to be a very powerful tool in acoustic modelling, discriminative training presents a major drawback: the lack of a formulation guaranteeing convergence in no matter which initial conditions, such as the Baum-Welch algorithm in maximum likelihood training. For this reason, a gradient descent search is usually used in this kind of problem. Unfortunately, standard gradient descent algorithms rely heavily on the election of the learning rates. This dependence is specially cumbersome because it represents that, at each run of the discriminative training procedure, a search should be carried out over the parameters ruling the algorithm. In this paper we describe an adaptive procedure for determining the optimal value of the step size at each iteration. While the calculus and memory overhead of the algorithm is negligible, results show less dependence on the initial learning rate than standard gradient descent and, using the same idea in order to apply self-scaling, it clearly outperforms it.
Cite as: Nogueiras-Rodriguez, A., Mariño, J.B., Monte, E. (1998) An adaptive gradient-search based algorithm for discriminative training of HMM's. Proc. 5th International Conference on Spoken Language Processing (ICSLP 1998), paper 0769, doi: 10.21437/ICSLP.1998-190
@inproceedings{nogueirasrodriguez98_icslp,
author={Albino Nogueiras-Rodriguez and José B. Mariño and Enric Monte},
title={{An adaptive gradient-search based algorithm for discriminative training of HMM's}},
year=1998,
booktitle={Proc. 5th International Conference on Spoken Language Processing (ICSLP 1998)},
pages={paper 0769},
doi={10.21437/ICSLP.1998-190}
}