• DocumentCode
    519492
  • Title

    A bounded trust region optimization for discriminative training of HMMS in speech recognition

  • Author

    Liu, Cong ; Hu, Yu ; Jiang, Hui ; Dai, Li-Rong

  • Author_Institution
    iFlytek Speech Lab., Univ. of Sci. & Technol. of China, Hefei, China
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    4914
  • Lastpage
    4917
  • Abstract
    In this paper, we have proposed a new method to construct an auxiliary function for the discriminative training of HMMs in speech recognition. The new auxiliary function serves as a first-order approximation of the original objective function but more importantly it remains as a lower bound of the original objective function as well. Furthermore, the trust region (TR) method in [1] is applied to find the globally optimal point of the new auxiliary function. Due to its lower-bound property, the found optimal point is theoretically guaranteed to increase the original discriminative objective function. The proposed bounded trust region method has been investigated on two LVCSR tasks, namely WSJ-5k and Switchboard 60-hour subset tasks. Experimental results show that the bounded TR method yields much better convergence behavior than both the conventional EBW method and the original TR method.
  • Keywords
    hidden Markov models; optimisation; speech recognition; HMM; LVCSR tasks; Switchboard 60-hour subset task; WSJ-5k; bounded trust region optimization; discriminative training; first-order approximation; original discriminative objective function; speech recognition; Computer science; Convergence; Hidden Markov models; Iterative algorithms; Optimization methods; Speech recognition; Strontium; Auxiliary function; Hidden Markov models; Optimization methods; Speech recognition; Trust region method;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on
  • Conference_Location
    Dallas, TX
  • ISSN
    1520-6149
  • Print_ISBN
    978-1-4244-4295-9
  • Electronic_ISBN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.2010.5495111
  • Filename
    5495111