• Corpus ID: 222141766

ERFit: Entropic Regression Fit Matlab Package, for Data-Driven System Identification of Underlying Dynamic Equations

@article{AlMomani2020ERFitER,
  title={ERFit: Entropic Regression Fit Matlab Package, for Data-Driven System Identification of Underlying Dynamic Equations},
  author={Abd AlRahman R AlMomani and Erik M. Bollt},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.02411}
}
Data-driven sparse system identification becomes the general framework for a wide range of problems in science and engineering. It is a problem of growing importance in applied machine learning and artificial intelligence algorithms. In this work, we developed the Entropic Regression Software Package (ERFit), a MATLAB package for sparse system identification using the entropic regression method. The code requires minimal supervision, with a wide range of options that make it adapt easily to… 
1 Citations

Figures from this paper

Entropic regression with neurologically motivated applications.

An information theoretic approach is used, which defines direct information flow in terms of causation entropy, to improve upon the accuracy of the recovery of the true network structure over popularly used methods for this task such as correlation and least absolute shrinkage and selection operator regression.

References

SHOWING 1-10 OF 17 REFERENCES

How Entropic Regression Beats the Outliers Problem in Nonlinear System Identification

This work developed a nonlinear System Identification (SID) method that is called Entropic Regression, which adopts an information-theoretic measure for the data-driven discovery of the underlying dynamics in high-dimensional systems such as complex networks.

An extended orthogonal forward regression algorithm for system identification using entropy

A new optimality criterion, Shannon's entropy power reduction ratio (EPRR), is introduced to deal with both Gaussian and non-Gaussian signals in a non-linear dynamic stochastic system identification algorithm.

Discovering governing equations from data by sparse identification of nonlinear dynamical systems

This work develops a novel framework to discover governing equations underlying a dynamical system simply from data measurements, leveraging advances in sparsity techniques and machine learning and using sparse regression to determine the fewest terms in the dynamic governing equations required to accurately represent the data.

Sparse Identification of Nonlinear Dynamics with Control (SINDYc)

Sparse identification of nonlinear dynamics for model predictive control in the low-data limit

The recent sparse identification of nonlinear dynamics (SINDY) modelling procedure is extended to include the effects of actuation and it is demonstrated that the resulting SINDY-MPC framework has higher performance, requires significantly less data, and is more computationally efficient and robust to noise than NN models, making it viable for online training and execution in response to rapid system changes.

Identifying the Coupling Structure in Complex Systems through the Optimal Causation Entropy Principle

This work presents an application of the optimal causation entropy (oCSE) principle to identify the coupling structure of a synthetic biological system, the repressilator, and presents and jointly applies the aggregative discovery and progressive removal algorithms based on the oCSE principle to infer the coupling structures of the system from the measured data.

Orthogonal least squares methods and their application to non-linear system identification

Abstract Identification algorithms based on the well-known linear least squares methods of gaussian elimination, Cholesky decomposition, classical Gram-Schmidt, modified Gram-Schmidt, Householder

Predicting chaotic time series with a partial model.

A counterintuitive implication of the results is that knowledge of the evolution equation of even one variable, if known, can improve forecasting of all variables.

Equations of Motion from a Data Series

A method to reconstruct the deterministic portion of the equations of motion directly from a data series to represent a vast reduction of a chaotic data set’s observed complexity to a compact, algorithmic specification is described.