The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Convergence of the SINDy Algorithm
Open accessAbstract
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 [S. L. Brunton, J. L. Proctor, and J. N. Kutz, Proc. Nat. Acad. Sci. USA, 113 (2016), pp. 3932--3937]. 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, conditions for one-step recovery, and a recovery result with respect to the condition number and noise. Examples illustrate that the rates of convergence are sharp. In addition, our results extend to other algorithms related to the algorithm in [S. L. Brunton, J. L. Proctor, and J. N. Kutz, Proc. Nat. Acad. Sci. USA, 113 (2016), pp. 3932--3937], and provide theoretical verification of several observed phenomena.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Automated reverse engineering of nonlinear dynamical systems
Bongard, J., & Lipson, H. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0609476104 · Cited by 792
Sparse identification of nonlinear dynamics for rapid model recovery
Quade, M., Abel, M., Nathan Kutz, J., & Brunton, S. L. (2018) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5027470 · Cited by 163
Cited by
Data-driven discovery of coordinates and governing equations
Champion, K., Lusch, B., Kutz, J. N., & Brunton, S. L. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1906995116 · Cited by 909
Physics-informed learning of governing equations from scarce data
Chen, Z., Liu, Y., & Sun, H. (2021) · Nature Communications · doi:10.1038/s41467-021-26434-1 · Cited by 609
SINDy-PI: a robust algorithm for parallel implicit sparse identification of nonlinear dynamics
Kaheman, K., Kutz, J. N., & Brunton, S. L. (2020) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2020.0279 · Cited by 276
Metadata
- Authors
- Zhang, L., & Schaeffer, H.
- Venue
- Multiscale Modeling & Simulation
- Published
- 2019-01
- Volume
- 17
- Issue
- 3
- Pages
- 948-972
- ISSN
- 1540-3459 (ISSN-L)
- 1540-3467
- OpenAlex
- W2963113802
- Cited by
- 177
- References
- 2
- FWCI
- 10.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.