Related Experiment Videos
Online learning with hidden markov models
Gianluigi Mongillo1, Sophie Deneve
1Group for Neural Theory, Department d'Etudes Cognitives, Ecole Normale Supérieure, Collège de France, Paris 75006, France. Gianluigi.Mongillo@ens.fr
Abstract:
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.
Related Concept Videos
Observational Learning
Introduction to Learning
In contrast to learned behaviors, unlearned behaviors such as crying, sexual...
Masking and Demasking Agents
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on the metal...
Associative Learning
Classical conditioning, also known...
Multi-input and Multi-variable systems
In the absence of...
Cognitive Learning
E. C. Tolman's theory of purposive behavior emphasizes that much behavior is goal-directed. He argued that to understand behavior, we must look at the entire sequence of actions leading to a goal. For instance, high school students study hard, not just due to past reinforcement but also to achieve the goal of getting into a good college.
Tolman introduced the idea that behavior is influenced by...