Online learning with hidden markov models.
We present an online version of the expectation-maximization (EM) algorithm for hidden Markov models (HMMs). The sufficient statistics required for parameters estimation is computed recursively with time, that is, in an online way instead of using the batch forward-backward procedure. This computational scheme is generalized to the case where the model parameters can change with time by introducing a discount factor into the recurrence relations. The resulting algorithm is equivalent to the batch EM algorithm, for appropriate discount factor and scheduling of parameters update. On the other hand, the online algorithm is able to deal with dynamic environments, i.e., when the statistics of the observed data is changing with time. The implications of the online algorithm for probabilistic modeling in neuroscience are briefly discussed.
Mongillo
Gianluigi
G
Group for Neural Theory, Department d'Etudes Cognitives, Ecole Normale Supérieure, Collège de France, Paris 75006, France. Gianluigi.Mongillo@ens.fr
Deneve
Sophie
S
D000465:Algorithms; D001185:Artificial Intelligence; D008390:Markov Chains; D011336:Probability; D013997:Time Factors