TL;DR
This paper introduces a framework for learning dynamical systems from limited noisy data by integrating various types of side information through convex constraints, enhancing modeling accuracy in scientific applications.
Contribution
It develops a convex optimization approach using semidefinite programming to incorporate side information into polynomial dynamical system learning.
Findings
Side information improves learning accuracy in physics, biology, and epidemiology models.
Convex constraints effectively incorporate domain knowledge into the learning process.
Polynomial models can approximate complex systems while satisfying side information.
Abstract
We present a mathematical and computational framework for the problem of learning a dynamical system from noisy observations of a few trajectories and subject to side information. Side information is any knowledge we might have about the dynamical system we would like to learn besides trajectory data. It is typically inferred from domain-specific knowledge or basic principles of a scientific discipline. We are interested in explicitly integrating side information into the learning process in order to compensate for scarcity of trajectory observations. We identify six types of side information that arise naturally in many applications and lead to convex constraints in the learning problem. First, we show that when our model for the unknown dynamical system is parameterized as a polynomial, one can impose our side information constraints computationally via semidefinite programming. We…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
