Causal discovery for time series with latent confounders

• URL: http://arxiv.org/abs/2209.03427v1
• Date: Wed, 7 Sep 2022 18:57:19 GMT
• Title: Causal discovery for time series with latent confounders
• Authors: Christian Reiser
• Abstract summary: This work evaluates the LPCMCI algorithm, which aims to find generators compatible with a multi-dimensional, highly autocorrelated time series. We find that LPCMCI performs much better than a random algorithm mimicking not knowing anything but is still far from optimal detection.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• CAnDOIT: Causal Discovery with Observational and Interventional Data from Time-Series [4.008958683836471]
  CAnDOIT is a causal discovery method to reconstruct causal models using both observational and interventional data. The use of interventional data in the causal analysis is crucial for real-world applications, such as robotics. A Python implementation of CAnDOIT has also been developed and is publicly available on GitHub.
  arXiv  Detail & Related papers  (2024-10-03T13:57:08Z)
• Testing Causal Models with Hidden Variables in Polynomial Delay via Conditional Independencies [49.99600569996907]
  Testing a hypothesized causal model against observational data is a key prerequisite for many causal inference tasks. While a model can assume exponentially many conditional independence relations (CIs), testing all of them is both impractical and unnecessary. We introduce c-LMP for causal graphs with hidden variables and develop a delay algorithm to list these CIs in poly-time intervals.
  arXiv  Detail & Related papers  (2024-09-22T21:05:56Z)
• Causal Discovery in Semi-Stationary Time Series [32.424281626708336]
  We propose a constraint-based, non-parametric algorithm for discovering causal relations in observational time series. We show that this algorithm is sound in identifying causal relations on discrete time series.
  arXiv  Detail & Related papers  (2024-07-10T00:55:38Z)
• Correlation-aware Spatial-Temporal Graph Learning for Multivariate Time-series Anomaly Detection [67.60791405198063]
  We propose a correlation-aware spatial-temporal graph learning (termed CST-GL) for time series anomaly detection. CST-GL explicitly captures the pairwise correlations via a multivariate time series correlation learning module. A novel anomaly scoring component is further integrated into CST-GL to estimate the degree of an anomaly in a purely unsupervised manner.
  arXiv  Detail & Related papers  (2023-07-17T11:04:27Z)
• Bootstrap aggregation and confidence measures to improve time series causal discovery [0.0]
  We introduce a novel bootstrap approach designed for time series causal discovery that preserves the temporal dependencies and lag structure. We combine this approach with the state-of-the-art conditional-independence-based algorithm PCMCI+.
  arXiv  Detail & Related papers  (2023-06-15T08:37:16Z)
• Causality-Based Multivariate Time Series Anomaly Detection [63.799474860969156]
  We formulate the anomaly detection problem from a causal perspective and view anomalies as instances that do not follow the regular causal mechanism to generate the multivariate data. We then propose a causality-based anomaly detection approach, which first learns the causal structure from data and then infers whether an instance is an anomaly relative to the local causal mechanism. We evaluate our approach with both simulated and public datasets as well as a case study on real-world AIOps applications.
  arXiv  Detail & Related papers  (2022-06-30T06:00:13Z)
• Unsupervised Deep Anomaly Detection for Multi-Sensor Time-Series Signals [10.866594993485226]
  We propose a novel deep learning-based anomaly detection algorithm called Deep Convolutional Autoencoding Memory network (CAE-M) We first build a Deep Convolutional Autoencoder to characterize spatial dependence of multi-sensor data with a Maximum Mean Discrepancy (MMD) Then, we construct a Memory Network consisting of linear (Autoregressive Model) and non-linear predictions (Bigressive LSTM with Attention) to capture temporal dependence from time-series data.
  arXiv  Detail & Related papers  (2021-07-27T06:48:20Z)
• Consistency of mechanistic causal discovery in continuous-time using Neural ODEs [85.7910042199734]
  We consider causal discovery in continuous-time for the study of dynamical systems. We propose a causal discovery algorithm based on penalized Neural ODEs.
  arXiv  Detail & Related papers  (2021-05-06T08:48:02Z)
• Accelerating Recursive Partition-Based Causal Structure Learning [4.357523892518871]
  Recursive causal discovery algorithms provide good results by using Conditional Independent (CI) tests in smaller sub-problems. This paper proposes a generic causal structure refinement strategy that can locate the undesired relations with a small number of CI-tests. We then empirically evaluate its performance against the state-of-the-art algorithms in terms of solution quality and completion time in synthetic and real datasets.
  arXiv  Detail & Related papers  (2021-02-23T08:28:55Z)
• TadGAN: Time Series Anomaly Detection Using Generative Adversarial Networks [73.01104041298031]
  TadGAN is an unsupervised anomaly detection approach built on Generative Adversarial Networks (GANs) To capture the temporal correlations of time series, we use LSTM Recurrent Neural Networks as base models for Generators and Critics. To demonstrate the performance and generalizability of our approach, we test several anomaly scoring techniques and report the best-suited one.
  arXiv  Detail & Related papers  (2020-09-16T15:52:04Z)
• Learning Causal Models Online [103.87959747047158]
  Predictive models can rely on spurious correlations in the data for making predictions. One solution for achieving strong generalization is to incorporate causal structures in the models. We propose an online algorithm that continually detects and removes spurious features.
  arXiv  Detail & Related papers  (2020-06-12T20:49:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.