Causal Identification in Time Series Models

• URL: http://arxiv.org/abs/2504.20172v1
• Date: Mon, 28 Apr 2025 18:10:39 GMT
• Title: Causal Identification in Time Series Models
• Authors: Erik Jahn, Karthik Karnik, Leonard J. Schulman,
• Abstract summary: We show that applying the Causal Identification algorithm to a constant-size segment of the time series graph is sufficient to decide identifiability of causal effects.
• Score: 3.2635082758250693
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we analyze the applicability of the Causal Identification algorithm to causal time series graphs with latent confounders. Since these graphs extend over infinitely many time steps, deciding whether causal effects across arbitrary time intervals are identifiable appears to require computation on graph segments of unbounded size. Even for deciding the identifiability of intervention effects on variables that are close in time, no bound is known on how many time steps in the past need to be considered. We give a first bound of this kind that only depends on the number of variables per time step and the maximum time lag of any direct or latent causal effect. More generally, we show that applying the Causal Identification algorithm to a constant-size segment of the time series graph is sufficient to decide identifiability of causal effects, even across unbounded time intervals.

Related papers

• Using Time Structure to Estimate Causal Effects [12.658042559371712]
  We present a novel approach for estimating direct (and via Wright's path rule total) causal effects in a time series setup. This approach assumes that the underlying time series is a Structural Vector Autoregressive process.
  arXiv  Detail & Related papers  (2025-04-15T11:21:37Z)
• On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
  Temporally causal representation learning aims to identify the latent causal process from time series observations. Most methods require the assumption that the latent causal processes do not have instantaneous relations. We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
  arXiv  Detail & Related papers  (2024-05-24T08:08:05Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Identifiability of total effects from abstractions of time series causal graphs [2.5515299924109858]
  We study the problem of identifiability of the total effect of an intervention from observational time series.<n>We consider two abstractions: the extended summary causal graph and the summary causal graph.
  arXiv  Detail & Related papers  (2023-10-23T08:31:26Z)
• Causal Discovery and Prediction: Methods and Algorithms [0.0]
  In this thesis we introduce a generic a-priori assessment of each possible intervention. We propose an active learning algorithm that identifies the causal relations in any given causal model.
  arXiv  Detail & Related papers  (2023-09-18T01:19:37Z)
• Identifiability of Direct Effects from Summary Causal Graphs [1.0878040851638]
  This paper characterizes all cases for which the direct effect is graphically identifiable from a summary causal graph. It gives two sound finite adjustment sets that can be used to estimate the direct effect whenever it is identifiable.
  arXiv  Detail & Related papers  (2023-06-29T14:05:35Z)
• DOMINO: Visual Causal Reasoning with Time-Dependent Phenomena [59.291745595756346]
  We propose a set of visual analytics methods that allow humans to participate in the discovery of causal relations associated with windows of time delay. Specifically, we leverage a well-established method, logic-based causality, to enable analysts to test the significance of potential causes. Since an effect can be a cause of other effects, we allow users to aggregate different temporal cause-effect relations found with our method into a visual flow diagram.
  arXiv  Detail & Related papers  (2023-03-12T03:40:21Z)
• Effect Identification in Cluster Causal Diagrams [51.42809552422494]
  We introduce a new type of graphical model called cluster causal diagrams (for short, C-DAGs) C-DAGs allow for the partial specification of relationships among variables based on limited prior knowledge. We develop the foundations and machinery for valid causal inferences over C-DAGs.
  arXiv  Detail & Related papers  (2022-02-22T21:27:31Z)
• Normalized multivariate time series causality analysis and causal graph reconstruction [0.0]
  Causality analysis is an important problem lying at the heart of science, and is of particular importance in data science and machine learning. This study introduces to the community this line of work, with a long-due generalization of the information flow-based bivariate time series causal inference. The resulting formula is transparent, and can be implemented as a computationally very efficient algorithm for application.
  arXiv  Detail & Related papers  (2021-04-23T00:46:35Z)
• Fuzzy Stochastic Timed Petri Nets for Causal properties representation [68.8204255655161]
  Causal relations are frequently represented by directed graphs, with nodes denoting causes and links denoting causal influence. Common methods used for graphically representing causal scenarios are neurons, truth tables, causal Bayesian networks, cognitive maps and Petri Nets. We will show that, even though the traditional models are able to represent separately some of the properties aforementioned, they fail trying to illustrate indistinctly all of them.
  arXiv  Detail & Related papers  (2020-11-24T13:22:34Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)

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.