# Sparse Identification of Nonlinear Dynamics with Side Information (SINDy-SI)

arXiv: https://arxiv.org/abs/2310.04227 · HTML: https://mlsanity.com/paper/2310.04227/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Oct 2023.

## Built on by (most cited first, 2 of 2)

- [Sparse identification of nonlinear dynamics with library optimization mechanism: Recursive long-term prediction perspective](https://mlsanity.com/paper/2507.18220/) (2025)
- [Learning Polynomial Representations of Physical Objects with Application to Certifying Correct Packing Configurations](https://mlsanity.com/paper/2312.06791/) (2023)

## Abstract (arXiv)

Modern societies have an abundance of data yet good system models are rare. Unfortunately, many of the current system identification and machine learning techniques fail to generalize outside of the training set, producing models that violate basic physical laws. This work proposes a novel method for the Sparse Identification of Nonlinear Dynamics with Side Information (SINDy-SI). SINDy-SI is an iterative method that uses Sum-of-Squares (SOS) programming to learn optimally fitted models while guaranteeing that the learned model satisfies side information, such as symmetry's and physical laws. Guided by the principle of Occam's razor, that the simplest or most regularized best fitted model is typically the superior choice, during each iteration SINDy-SI prunes the basis functions associated with small coefficients, yielding a sparse dynamical model upon termination. Through several numerical experiments we will show how the combination of side information constraints and sparse polynomial representation cultivates dynamical models that obey known physical laws while displaying impressive generalized performance beyond the training set.