Predicting sparse circle maps from their dynamics

11/14/2019
by   Felix Krahmer, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2018

Data-Driven Sparse System Identification

In this paper, we study the system identification porblem for sparse lin...
research
05/07/2019

The algorithm for the recovery of integer vector via linear measurements

In this paper we continue the studies on the integer sparse recovery pro...
research
07/22/2021

Recovering lost and absent information in temporal networks

The full range of activity in a temporal network is captured in its edge...
research
08/03/2023

Exact identification of nonlinear dynamical systems by Trimmed Lasso

Identification of nonlinear dynamical systems has been popularized by sp...
research
10/12/2019

Generalized Nullspace Property for Structurally Sparse Signals

We propose a new framework for studying the exact recovery of signals wi...
research
02/04/2022

Towards optimal sampling for learning sparse approximation in high dimensions

In this chapter, we discuss recent work on learning sparse approximation...
research
07/01/2013

Short Term Memory Capacity in Networks via the Restricted Isometry Property

Cortical networks are hypothesized to rely on transient network activity...

Please sign up or login with your details

Forgot password? Click here to reset