arXiv Analytics

Sign in

arXiv:1805.06445 [math.OC]AbstractReferencesReviewsResources

On the Convergence of the SINDy Algorithm

Linan Zhang, Hayden Schaeffer

Published 2018-05-16Version 1

One way to understand time-series data is to identify the underlying dynamical system which generates it. This task can be done by selecting an appropriate model and a set of parameters which best fits the dynamics while providing the simplest representation (i.e. the smallest amount of terms). One such approach is the sparse identification of nonlinear dynamics framework [6] which uses a sparsity-promoting algorithm that iterates between a partial least-squares fit and a thresholding (sparsity-promoting) step. In this work, we provide some theoretical results on the behavior and convergence of the algorithm proposed in [6]. In particular, we prove that the algorithm approximates local minimizers of an unconstrained $\ell^0$-penalized least-squares problem. From this, we provide sufficient conditions for general convergence, rate of convergence, and conditions for one-step recovery. Examples illustrate that the rates of convergence are sharp. In addition, our results extend to other algorithms related to the algorithm in [6], and provide theoretical verification to several observed phenomena.

Related articles: Most relevant | Search more
arXiv:1504.06017 [math.OC] (Published 2015-04-23)
Network Newton-Part I: Algorithm and Convergence
arXiv:1709.06466 [math.OC] (Published 2017-09-19)
Evaluation of the Rate of Convergence in the PIA
arXiv:math/0212255 [math.OC] (Published 2002-12-18)
The Convergence of the Extended Kalman Filter