Predicting sparse circle maps from their dynamics

Abstract

The problem of identifying a dynamical system from its dynamics is of great importance for many applications. Recently it has been suggested to impose sparsity models for improved recovery performance. In this paper, we provide recovery guarantees for such a scenario. More precisely, we show that ergodic systems on the circle described by sparse trigonometric polynomials can be recovered from a number of samples scaling near-linearly in the sparsity.

References in corpus (6)

• Simultaneous analysis of Lasso and Dantzig selector
• On the conditions used to prove oracle results for the Lasso
• Koopman invariant subspaces and finite linear representations of nonlinear dynamical systems for control
• Predicting catastrophes in nonlinear dynamical systems by compressive sensing
• RIPless compressed sensing from anisotropic measurements
• Compressive sampling and dynamic mode decomposition