A Reaction Network Scheme Which Implements Inference and Learning for Hidden Markov Models

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With a view towards molecular communication systems and molecular multi-agent systems, we propose the Chemical Baum-Welch Algorithm, a novel reaction network scheme that learns parameters for Hidden Markov Models (HMMs). Each reaction in our scheme changes only one molecule of one species to one molecule of another. The reverse change is also accessible but via a different set of enzymes, in a design reminiscent of futile cycles in biochemical pathways. We show that every fixed point of the Baum-Welch algorithm for HMMs is a fixed point of our reaction network scheme, and every positive fixed point of our scheme is a fixed point of the Baum-Welch algorithm. We prove that the “Expectation” step and the “Maximization” step of our reaction network separately converge exponentially fast. We simulate mass-action kinetics for our network on an example sequence, and show that it learns the same parameters for the HMM as the Baum-Welch algorithm.

Cite

CITATION STYLE

APA

Singh, A., Wiuf, C., Behera, A., & Gopalkrishnan, M. (2019). A Reaction Network Scheme Which Implements Inference and Learning for Hidden Markov Models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11648 LNCS, pp. 54–79). Springer Verlag. https://doi.org/10.1007/978-3-030-26807-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free