Using Machine Learning to Assess Short Term Causal Dependence and Infer Network Links

December 05, 2019 Β· Declared Dead Β· πŸ› Chaos

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Amitava Banerjee, Jaideep Pathak, Rajarshi Roy, Juan G. Restrepo, Edward Ott arXiv ID 1912.02721 Category nlin.AO Cross-listed cond-mat.dis-nn, cs.LG, nlin.CD Citations 35 Venue Chaos Last Checked 3 months ago
Abstract
We introduce and test a general machine-learning-based technique for the inference of short term causal dependence between state variables of an unknown dynamical system from time series measurements of its state variables. Our technique leverages the results of a machine learning process for short time prediction to achieve our goal. The basic idea is to use the machine learning to estimate the elements of the Jacobian matrix of the dynamical flow along an orbit. The type of machine learning that we employ is reservoir computing. We present numerical tests on link inference of a network of interacting dynamical nodes. It is seen that dynamical noise can greatly enhance the effectiveness of our technique, while observational noise degrades the effectiveness. We believe that the competition between these two opposing types of noise will be the key factor determining the success of causal inference in many of the most important application situations.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” nlin.AO

R.I.P. πŸ‘» Ghosted

When slower is faster

Carlos Gershenson, Dirk Helbing

nlin.AO πŸ› Complex πŸ“š 65 cites 10 years ago

Died the same way β€” πŸ‘» Ghosted