Survey and Evaluation of Causal Discovery Methods for Time Series (Extended Abstract)

Charles K. Assaad, Emilie Devijver, Éric Gaussier

Executive Summary

This research provides a comprehensive mapping of the causal discovery landscape for time series data, categorizing existing algorithms into four primary families: Granger, constraint-based, noise-based, and score-based. The study concludes that no universal "silver bullet" exists; the optimal method depends heavily on data characteristics such as stationarity, linearity, and causal sufficiency.

Introduction

In domains ranging from healthcare to industrial systems, the proliferation of time series data has shifted focus from simple prediction to causal inference. Identifying whether a specific intervention causes an observed effect—rather than being merely correlated due to a hidden confounder—is critical. This process, known as causal discovery, faces unique challenges in time series, including temporal lags, autocorrelation, and varying sampling frequencies. This paper establishes a unified framework to navigate the diverse array of available algorithms.

Taxonomy of Causal Discovery Methods

The authors categorize the field into four foundational methodological families:

  1. Granger Causality: Based on the principle that a cause must precede its effect. If the past of variable $X$ improves the prediction of the future of $Y$ beyond what $Y$’s own history provides, $X$ is said to Granger-cause $Y$.
  2. Constraint-based Methods: Algorithms like PCMCI and tsFCI utilize statistical tests to identify conditional independencies. They construct a graph "skeleton" and apply orientation rules, such as temporal priority, to determine causal direction.
  3. Noise-based Methods: These approaches (e.g., VarLiNGAM) analyze the distribution of residuals. In non-Gaussian or non-linear settings, the asymmetry of noise can reveal the direction of causal flow.
  4. Score-based Methods: Discovery is framed as an optimization problem. Methods like DYNOTEARS search for a graph structure that maximizes a goodness-of-fit score while penalizing model complexity.

Visualization Framework

The paper identifies three distinct ways to represent causal relationships in time series, varying in their level of granularity:

Comparison of Full Time (a), Window (b), and Summary (c) Causal Graphs.
  • Full Time Causal Graphs: The most granular representation, showing every interaction across all time steps.
  • Window Causal Graphs: Focus on relationships over specific temporal lags.
  • Summary Causal Graphs: The most abstract view, collapsing temporal details into a single directed graph of variables.

Core Theoretical Considerations

The evaluation highlights several critical factors that influence algorithm performance:

  • The "No Free Lunch" Theorem: Algorithm selection must be guided by the specific assumptions (e.g., linearity, absence of hidden variables) that the data satisfies.
  • Causal Sufficiency and Hidden Variables: Most methods assume all common causes are measured. However, real-world data often contains "hidden confounders." Only a subset of methods, such as TCDF or tsFCI, are robust to these unobserved factors.
  • Instantaneous vs. Lagged Effects: Low sampling frequencies can make causal effects appear to happen within the same time step. Approximately half of the surveyed methods struggle with these "instantaneous" relationships.

Comparative Analysis of Algorithms

The primary contribution of this work is a systematic comparison of nine representative algorithms across various technical dimensions.

Table 1: Comparison of causal discovery methods based on their theoretical assumptions and capabilities.

Key findings from the comparative analysis include:

  • Hyperparameter Sensitivity: Most methods are relatively accessible, requiring fewer than five hyperparameters. Deep-learning-based approaches like TCDF are notable exceptions, requiring more extensive tuning.
  • Output Granularity: Only about 50% of the surveyed algorithms can produce "Window Causal Graphs," which are essential for understanding the precise timing of causal impacts.
  • Linearity Bias: A significant portion of popular algorithms still rely on linear models, potentially failing to capture complex non-linear dynamics common in biological or physical systems.

Conclusion and Future Directions

Current causal discovery methods face several "frontiers" that define future research:

  • Non-Stationarity: Developing methods for systems where causal rules change over time.
  • Temporal Aggregation: Addressing the loss of causal signal when data is aggregated into larger time buckets.
  • Mixed Data Types: Improving the handling of datasets containing both categorical and continuous variables.

The authors suggest that the next generation of tools will likely be hybrid methods that synthesize the strengths of different families—for instance, using noise-based techniques to orient edges initially identified through constraint-based testing.

Summary updated

Abstract

We introduce in this survey the major concepts, models, and algorithms proposed so far to infer causal relations from observational time series, a task usually referred to as causal discovery in time series. To do so, after a description of the underlying concepts and modelling assumptions, we present different methods according to the family of approaches they belong to: Granger causality, constraint-based approaches, noise-based approaches, score-based approaches, logic-based approaches, topology-based approaches, and difference-based approaches. We then evaluate several representative methods to illustrate the behaviour of different families of approaches. This illustration is conducted on both artificial and real datasets, with different characteristics. The main conclusions one can draw from this survey is that causal discovery in times series is an active research field in which new methods (in every family of approaches) are regularly proposed, and that no family or method stands out in all situations. Indeed, they all rely on assumptions that may or may not be appropriate for a particular dataset.
BibTeX
@inproceedings{assaad2023survey,
  author = {Charles K. Assaad and Emilie Devijver and Éric Gaussier},
  title = {{Survey and Evaluation of Causal Discovery Methods for Time Series (Extended Abstract)}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2023},
  doi = {10.24963/ijcai.2023/766},
}
Figure