A reaction network scheme which implements inference and learning for Hidden Markov Models
Preprint
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.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Chemical reaction network designs for asynchronous logic circuitsNatural Computing, 2017
- Modular verification of chemical reaction network encodings via serializability analysisTheoretical Computer Science, 2016
- Two-domain DNA strand displacementMathematical Structures in Computer Science, 2013
- Catalysis in Reaction NetworksBulletin of Mathematical Biology, 2011
- Strand algebras for DNA computingNatural Computing, 2010
- Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction NetworksBulletin of Mathematical Biology, 2010
- Computation with finite stochastic chemical reaction networksNatural Computing, 2008
- A Synthetic DNA Walker for Molecular TransportJournal of the American Chemical Society, 2004
- A Precisely Controlled DNA Biped Walking DeviceNano Letters, 2004
- On chemical kinetics of a certain classArchive for Rational Mechanics and Analysis, 1972