On reaction network implementations of neural networks
David F. Anderson, Badal Joshi, and Abhishek Deshpande

TL;DR
This paper develops a mathematical framework for implementing neural networks using chemical reaction networks, ensuring properties like unique fixed points and fast convergence, and demonstrates this with a smoothed ReLU example.
Contribution
It introduces a novel approach to realize neural networks through chemical reaction networks with provable convergence and fixed point properties.
Findings
Reaction networks can implement neural network functions.
The associated ODEs have unique positive fixed points.
Fast convergence to fixed points is achievable.
Abstract
This paper is concerned with the utilization of deterministically modeled chemical reaction networks for the implementation of (feed-forward) neural networks. We develop a general mathematical framework and prove that the ordinary differential equations (ODEs) associated with certain reaction network implementations of neural networks have desirable properties including (i) existence of unique positive fixed points that are smooth in the parameters of the model (necessary for gradient descent), and (ii) fast convergence to the fixed point regardless of initial condition (necessary for efficient implementation). We do so by first making a connection between neural networks and fixed points for systems of ODEs, and then by constructing reaction networks with the correct associated set of ODEs. We demonstrate the theory by constructing a reaction network that implements a neural network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Methods*Communicated@Fast*How Do I Communicate to Expedia?
