Fast computation of Gaussian likelihoods using low-rank matrix approximations

• Main Authors: Gajjar, M. R., Sreenivas, T. V., Govindarajan, R.
• Format: Conference Proceeding
• Language: English
• Subjects: Acoustic Likelihood Computations; Acoustics; Approximation methods; Error analysis; Low-rank Matrix Approximation; Speech recognition; Training; Training data; Vectors
• ISSN: 2162-3562; 2162-3570
• DOI: 10.1109/SiPS.2011.6088983

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.