Causal discovery for time series with latent confounders
원문 초록
Reconstructing the causal relationships behind the phenomena we observe is a fundamental challenge in all areas of science. Discovering causal relationships through experiments is often infeasible, unethical, or expensive in complex systems. However, increases in computational power allow us to process the ever-growing amount of data that modern science generates, leading to an emerging interest in the causal discovery problem from observational data. This work evaluates the LPCMCI algorithm, which aims to find generators compatible with a multi-dimensional, highly autocorrelated time series while some variables are unobserved. We find that LPCMCI performs much better than a random algorithm mimicking not knowing anything but is still far from optimal detection. Furthermore, LPCMCI performs best on auto-dependencies, then contemporaneous dependencies, and struggles most with lagged dependencies. The source code of this project is available online.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Review of the Long Horizon Forecasting Problem in Time Series Analysis
The interplay of robustness and generalization in quantum machine learning
TimeGraph: Synthetic Benchmark Datasets for Robust Time-Series Causal Discovery
TimePoint: Accelerated Time Series Alignment via Self-Supervised Keypoint and Descriptor Learning
Generating Hypotheses of Dynamic Causal Graphs in Neuroscience: Leveraging Generative Factor Models of Observed Time Series
LASSO-ODE: A framework for mechanistic model identifiability and selection in disease transmission modeling
토론
이 논문과 연결된 포럼 글이 아직 없습니다.