Inferring biological networks by sparse identification of nonlinear dynamics
Niall M. Mangan, Steven L. Brunton, Joshua L. Proctor, J. Nathan Kutz

TL;DR
This paper introduces implicit-SINDy, a sparsity-based method for inferring nonlinear biological networks, including rational nonlinearities, from data, demonstrated on enzyme kinetics, bacterial regulation, and yeast glycolysis models.
Contribution
It extends the SINDy algorithm to handle implicit systems with rational nonlinearities, enabling more accurate biological network inference.
Findings
Successfully inferred enzyme kinetics, bacterial regulation, and yeast glycolysis models.
Generalized the method to implicit dynamical systems beyond rational nonlinearities.
Demonstrated effectiveness on canonical biological models.
Abstract
Inferring the structure and dynamics of network models is critical to understanding the functionality and control of complex systems, such as metabolic and regulatory biological networks. The increasing quality and quantity of experimental data enable statistical approaches based on information theory for model selection and goodness-of-fit metrics. We propose an alternative method to infer networked nonlinear dynamical systems by using sparsity-promoting optimization to select a subset of nonlinear interactions representing dynamics on a fully connected network. Our method generalizes the sparse identification of nonlinear dynamics (SINDy) algorithm to dynamical systems with rational function nonlinearities, such as biological networks. We show that dynamical systems with rational nonlinearities may be cast in an implicit form, where the equations may be identified in the…
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.
