system-identification   4

[1204.6265] Statistical inference for dynamical systems: a review
The topic of statistical inference for dynamical systems has been studied extensively across several fields. In this survey we focus on the problem of parameter estimation for non-linear dynamical systems. Our objective is to place results across distinct disciplines in a common setting and highlight opportunities for further research.
papers  to-read  dynamical-systems  machine-learning  system-identification  ergodic-theory 
24 days ago by mraginsky
[1109.0573] Phase Retrieval via Matrix Completion
"This paper considers the fundamental problem of recovering a general signal, an image for example, from the magnitude of its Fourier transform. This problem, also known as phase retrieval, arises in many applications and has challenged engineers, physicists, and mathematicians for decades. Its origin comes from the fact that detectors can often times only record the squared modulus of the Fresnel or Fraunhofer diffraction pattern of the radiation that is scattered from an object. In such settings, one cannot measure the phase of the optical wave reaching the detector and, therefore, much information about the scattered object or the optical field is lost since, as is well known, the phase encodes a lot of the structural content of the image we wish to form."
image-processing  inverse-problems  signal-processing  system-identification  frequency-space  algorithms  nudge-targets  numerical-methods 
october 2011 by Vaguery
[1011.0415] Learning Networks of Stochastic Differential Equations
"We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the dynamics. We tackle the problem of learning such a network from observation of the system trajectory over a time interval $T$.
We analyze the $\ell_1$-regularized least squares algorithm and, in the setting in which the underlying network is sparse, we prove performance guarantees that are \emph{uniform in the sampling rate} as long as this is sufficiently high. This result substantiates the notion of a well defined `time complexity' for the network inference problem."
papers  to-read  sparsity  complex-systems  system-identification  machine-learning 
november 2010 by mraginsky

Copy this bookmark:



description:


tags: