Spectral learning with proper probabilities for finite state automation

Abstract : Probabilistic Finite Automaton (PFA), Probabilistic Finite State Transducers (PFST) and Hidden Markov Models (HMM) are widely used in Automatic Speech Recognition (ASR), Text-to-Speech (TTS) systems and Part Of Speech (POS) tagging for language mod-eling. Traditionally, unsupervised learning of these latent variable models is done by Expectation-Maximization (EM)-like algorithms, as the Baum-Welch algorithm. In a recent alternative line of work, learning algorithms based on spectral properties of some low order moments matrices or tensors were proposed. In comparison to EM, they are orders of magnitude faster and come with theoretical convergence guarantees. However, returned models are not ensured to compute proper distributions. They often return negative values that do not sum to one, limiting their applicability and preventing them to serve as an initialization to EM-like algorithms. In this paper, we propose a new spectral algorithm able to learn a large range of models constrained to return proper distributions. We assess its performances on synthetic problems from the PAutomaC challenge and real datasets extracted from Wikipedia. Experiments show that it outperforms previous spectral approaches as well as the Baum-Welch algorithm with random restarts, in addition to serve as an efficient initialization step to EM-like algorithms.
Type de document :
Communication dans un congrès
ASRU 2015 - Automatic Speech Recognition and Understanding Workshop, Dec 2015, Scottsdale, United States. IEEE, Proceedings of the Automatic Speech Recognition and Understanding Workshop. 〈http://www.asru2015.org/〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01225810
Contributeur : Olivier Pietquin <>
Soumis le : lundi 9 novembre 2015 - 15:00:01
Dernière modification le : vendredi 13 avril 2018 - 01:26:59
Document(s) archivé(s) le : mercredi 10 février 2016 - 10:09:20

Fichier

ASRU_2015_HGCEOP.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01225810, version 1

Collections

Citation

Hadrien Glaude, Cyrille Enderli, Olivier Pietquin. Spectral learning with proper probabilities for finite state automation. ASRU 2015 - Automatic Speech Recognition and Understanding Workshop, Dec 2015, Scottsdale, United States. IEEE, Proceedings of the Automatic Speech Recognition and Understanding Workshop. 〈http://www.asru2015.org/〉. 〈hal-01225810〉

Partager

Métriques

Consultations de la notice

377

Téléchargements de fichiers

147