A reaction network scheme which implements inference and learning for Hidden Markov Models (1906.09410v2)
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.
- DNA as a universal substrate for chemical kinetics. Proceedings of the National Academy of Sciences, 107(12):5393–5398, 2010.
- Niranjan Srinivas. Programming chemical kinetics: engineering dynamic reaction networks with DNA strand displacement. PhD thesis, California Institute of Technology, 2015.
- Efficient Turing-universal computation with DNA polymers. In DNA computing and molecular programming, pages 123–140. 2011.
- Luca Cardelli. Strand Algebras for DNA Computing. Natural Computing, 10:407–428, 2011.
- Abstractions for DNA circuit design. Journal of The Royal Society Interface, 9(68):470–486, 2011.
- Luca Cardelli. Two-domain DNA strand displacement. Mathematical Structures in Computer Science, 23:02, 2013.
- Programmable chemical controllers made from DNA. Nature nanotechnology, 8(10):755–762, 2013.
- Modular verification of chemical reaction network encodings via serializability analysis. Theoretical Computer Science, 632:21–42, 2016.
- Enzyme-free nucleic acid dynamical systems. Science, 358:6369, 2017.
- Scaling up molecular pattern recognition with DNA-based winner-take-all neural networks. Nature, 559:7714, 2018.
- Molecular circuits for dynamic noise filtering. Proceedings of the National Academy of Sciences, 113(17):4729–4734, 2016.
- A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities. In International Conference on DNA-Based Computers, pages 232–248, 2017.
- Visual DSD: a design and analysis tool for dna strand displacement systems. Bioinformatics, 27(22):3211–3213, 2011.
- Chemical implementation of neural networks and Turing machines. Proceedings of the National Academy of Sciences, 88(24):10983–10987, 1991.
- Computing algebraic functions with biochemical reaction networks. Artificial life, 15(1):5–19, 2009.
- Biomolecular implementation of linear I/O systems. Systems Biology, IET, 5(4):252–260, 2011.
- Computation with finite stochastic chemical reaction networks. natural computing, 7(4):615–633, 2008.
- Deterministic function computation with chemical reaction networks. Natural computing, 13(4):517–534, 2014.
- Scaling up digital circuit computation with DNA strand displacement cascades. Science, 332(6034):1196–1201, 2011.
- Message passing inference with chemical reaction networks. Advances in Neural Information Processing Systems, pages 2247–2255, 2013.
- Neural Network Computation with DNA Strand Displacement Cascades. Nature, 475(7356):368–372, 2011.
- Chemical reaction network designs for asynchronous logic circuits. Natural computing, 17(1):109–130, 2018.
- Manoj Gopalkrishnan. A scheme for molecular computation of maximum likelihood estimators for log-linear models. In 22nd International Conference on DNA Computing and Molecular Programming, pages 3–18, 2016.
- A stochastic molecular scheme for an artificial cell to infer its environment from partial observations. In 23rd International Conference on DNA Computing and Molecular Programming, 2017.
- A reaction network scheme which implements the EM algorithm. In International Conference on DNA Computing and Molecular Programming, pages 189–207, 2018.
- Shunichi Amari. Information geometry and its applications. Springer, 2016.
- Information projections revisited. IEEE Transactions on Information Theory, 49(6):1474–1490, 2003.
- Edwin T. Jaynes. Information theory and statistical mechanics. Physical review, 106:4, 1957.
- A synthetic DNA walker for molecular transport. Journal of the American Chemical Society, 126(35):10834–10835, 2004.
- John Reif. The Design of Autonomous DNA Nano-mechanical Devices: Walking and Rolling DNA. DNA Computing, pages 439–461, 2003.
- A Precisely Controlled DNA Biped Walking Device. Nano Letters, 4:1203–1207, 2004.
- Elements of information theory. Wiley, John & Sons, 2012.
- L. R. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257–286, February 1989.
- Hidden Markov models for speech recognition. Technometrics, 33(3):251–272, 1991.
- Martin Feinberg. On chemical kinetics of a certain class. Arch. Rational Mech. Anal, 46, 1972.
- Friedrich J. M. Horn. Necessary and sufficient conditions for complex balancing in chemical kinetics. Arch. Rational Mech. Anal, 49, 1972.
- Martin Feinberg. Lectures on chemical reaction networks. http://www.che.eng.ohio-state.edu/FEINBERG/LecturesOnReactionNetworks/. 1979.
- Manoj Gopalkrishnan. Catalysis in Reaction Networks. Bulletin of Mathematical Biology, 73(12):2962–2982, 2011.
- Product-form stationary distributions for deficiency zero chemical reaction networks. Bulletin of mathematical biology, 72(8):1947–1970, 2010.
- Metabolic cycles as an underlying basis of biological oscillations. Nature reviews Molecular cell biology, 7:9, 2006.
- The EM algorithm and extensions, volume 382. Wiley, John & Sons, 2007.
- EM Algorithm with DNA Molecules. In Poster Presentations of the 24-th edition of International Conference on DNA Computing and Molecular Programming, 2018.
- Chemical boltzmann machines. In International Conference on DNA-Based Computers, pages 210–231, 2017.
- S. Roweis and Z. Ghahramani. A unifying review of linear Gaussian models. Neural Computation, 11(2):305–345, 1999.
- Wolfgang Maass. On the computational power of winner-take-all. Neural computation, 12(11):2519–2535, 2000.
- STDP installs in winner-take-all circuits an online approximation to hidden Markov model learning. PLoS computational biology, 10:3, 2014.
- Abhinav Singh (13 papers)
- Carsten Wiuf (45 papers)
- Abhishek Behera (4 papers)
- Manoj Gopalkrishnan (21 papers)