12th Annual Conference of the International Speech Communication Association

Florence, Italy
August 27-31. 2011

Convergence of Line Search A-Function Methods

Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, Bhuvana Ramabhadran

IBM T.J. Watson Research Center, USA

Recently, the Line Search A-Function (LSAF) was introduced as a technique that generalizes Extended Baum-Welch (EBW) algorithm for functions of continuous probability densities. It was shown that LSAF provides a unified scheme for a large class of optimization problems that involve discriminant objective functions of different probability densities or sparse representation objective functions such as Approximate Bayesian Compressive Sensing. In this paper, we show that a discrete EBW recursion (that was initially developed to optimize functions of discrete distributions) also fits the scope of LSAF technique. We demonstrate the utility and robustness of the technique for discrete distributions thru the experimental set up of a TIMIT phone classification task using a Convex Hull Sparse Representation approach with different Lq regularization (q being any positive number).

Full Paper

Bibliographic reference.  Kanevsky, Dimitri / Nahamoo, David / Sainath, Tara N. / Ramabhadran, Bhuvana (2011): "Convergence of line search a-function methods", In INTERSPEECH-2011, 997-1000.