On the Recoverability of Causal Relations from Temporally Aggregated I.I.D. Data

• URL: http://arxiv.org/abs/2406.02191v2
• Date: Tue, 11 Jun 2024 17:53:39 GMT
• Title: On the Recoverability of Causal Relations from Temporally Aggregated I.I.D. Data
• Authors: Shunxing Fan, Mingming Gong, Kun Zhang,
• Abstract summary: We consider the effect of temporal aggregation on instantaneous causal discovery in general setting. We show theoretically and experimentally that causal discovery results may be seriously distorted by aggregation.
• Score: 45.228979584422056
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We consider the effect of temporal aggregation on instantaneous (non-temporal) causal discovery in general setting. This is motivated by the observation that the true causal time lag is often considerably shorter than the observational interval. This discrepancy leads to high aggregation, causing time-delay causality to vanish and instantaneous dependence to manifest. Although we expect such instantaneous dependence has consistency with the true causal relation in certain sense to make the discovery results meaningful, it remains unclear what type of consistency we need and when will such consistency be satisfied. We proposed functional consistency and conditional independence consistency in formal way correspond functional causal model-based methods and conditional independence-based methods respectively and provide the conditions under which these consistencies will hold. We show theoretically and experimentally that causal discovery results may be seriously distorted by aggregation especially in complete nonlinear case and we also find causal relationship still recoverable from aggregated data if we have partial linearity or appropriate prior. Our findings suggest community should take a cautious and meticulous approach when interpreting causal discovery results from such data and show why and when aggregation will distort the performance of causal discovery methods.

Related papers

• 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)
• Self-Compatibility: Evaluating Causal Discovery without Ground Truth [28.72650348646176]
  We propose a novel method for falsifying the output of a causal discovery algorithm in the absence of ground truth. Our key insight is that while statistical learning seeks stability across subsets of data points, causal learning should seek stability across subsets of variables. We prove that detecting incompatibilities can falsify wrongly inferred causal relations due to violation of assumptions or errors from finite sample effects.
  arXiv  Detail & Related papers  (2023-07-18T18:59:42Z)
• Causal discovery for time series with constraint-based model and PMIME measure [0.0]
  We present a novel approach for discovering causality in time series data that combines a causal discovery algorithm with an information theoretic-based measure. We evaluate the performance of our approach on several simulated data sets, showing promising results.
  arXiv  Detail & Related papers  (2023-05-31T09:38:50Z)
• TC-GAT: Graph Attention Network for Temporal Causality Discovery [6.974417592057705]
  Causality is frequently intertwined with temporal elements, as the progression from cause to effect is not instantaneous but rather ensconced in a temporal dimension. We propose a method for extracting causality from the text that integrates both temporal and causal relations. We present a novel model, TC-GAT, which employs a graph attention mechanism to assign weights to the temporal relationships and leverages a causal knowledge graph to determine the adjacency matrix.
  arXiv  Detail & Related papers  (2023-04-21T02:26:42Z)
• Causal Discovery from Conditionally Stationary Time Series [18.645887749731923]
  State-Dependent Causal Inference (SDCI) is able to recover the underlying causal dependencies, provably with fully-observed states and empirically with hidden states. improved results over non-causal RNNs on modeling NBA player movements demonstrate the potential of our method.
  arXiv  Detail & Related papers  (2021-10-12T18:12:57Z)
• Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding [101.35070661471124]
  We show that unobserved confounding leaves a characteristic footprint in the observed data distribution that allows for disentangling spurious and causal effects. We propose an adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems.
  arXiv  Detail & Related papers  (2021-03-28T11:07:59Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Amortized Causal Discovery: Learning to Infer Causal Graphs from Time-Series Data [63.15776078733762]
  We propose Amortized Causal Discovery, a novel framework to learn to infer causal relations from time-series data. We demonstrate experimentally that this approach, implemented as a variational model, leads to significant improvements in causal discovery performance.
  arXiv  Detail & Related papers  (2020-06-18T19:59:12Z)
• 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.