Adaptive Mixtures of Probabilistic Transducers
Author:
- 1 November 1997
- journal article
- Published by MIT Press in Neural Computation
- Vol. 9 (8) , 1711-1733
Abstract
We describe and analyze a mixture model for supervised learning of probabilistic transducers. We devise an online learning algorithm that efficiently infers the structure and estimates the parameters of each probabilistic transducer in the mixture. Theoretical analysis and comparative simulations indicate that the learning algorithm tracks the best transducer from an arbitrarily large (possibly infinite) pool of models. We also present an application of the model for inducing a noun phrase recognizer.Keywords
This publication has 8 references indexed in Scilit:
- The power of amnesia: Learning probabilistic automata with variable memory lengthMachine Learning, 1997
- The Power of Amnesia: Learning Probabilistic Automata with Variable Memory LengthMachine Learning, 1996
- The context-tree weighting method: basic propertiesIEEE Transactions on Information Theory, 1995
- Hierarchical Mixtures of Experts and the EM AlgorithmNeural Computation, 1994
- The Weighted Majority AlgorithmInformation and Computation, 1994
- Learning and Extracting Finite State Automata with Second-Order Recurrent Neural NetworksNeural Computation, 1992
- Adaptive Mixtures of Local ExpertsNeural Computation, 1991
- The performance of universal encodingIEEE Transactions on Information Theory, 1981