Tangent Space Causal Inference: Leveraging Vector Fields for Causal Discovery in Dynamical Systems

• URL: http://arxiv.org/abs/2410.23499v1
• Date: Wed, 30 Oct 2024 23:08:12 GMT
• Title: Tangent Space Causal Inference: Leveraging Vector Fields for Causal Discovery in Dynamical Systems
• Authors: Kurt Butler, Daniel Waxman, Petar M. Djurić,
• Abstract summary: We propose the Tangent Space Causal Inference (TSCI) method for detecting causalities in dynamical systems. We first present a basic version of the TSCI algorithm, which is shown to be more effective than the basic CCM algorithm. We additionally present augmented versions of TSCI that leverage the expressive power of latent variable models and deep learning.
• Score: 0.8192907805418583
• License:
• Abstract: Causal discovery with time series data remains a challenging yet increasingly important task across many scientific domains. Convergent cross mapping (CCM) and related methods have been proposed to study time series that are generated by dynamical systems, where traditional approaches like Granger causality are unreliable. However, CCM often yields inaccurate results depending upon the quality of the data. We propose the Tangent Space Causal Inference (TSCI) method for detecting causalities in dynamical systems. TSCI works by considering vector fields as explicit representations of the systems' dynamics and checks for the degree of synchronization between the learned vector fields. The TSCI approach is model-agnostic and can be used as a drop-in replacement for CCM and its generalizations. We first present a basic version of the TSCI algorithm, which is shown to be more effective than the basic CCM algorithm with very little additional computation. We additionally present augmented versions of TSCI that leverage the expressive power of latent variable models and deep learning. We validate our theory on standard systems, and we demonstrate improved causal inference performance across a number of benchmark tasks.

Related papers

• LOCAL: Learning with Orientation Matrix to Infer Causal Structure from Time Series Data [13.390666123493409]
  LOCAL is a highly efficient, easy-to-implement, and constraint-free method for recovering dynamic causal structures. ACML generates causal masks using learnable priority vectors and the Gumbel-Sigmoid function. DGPL transforms causal learning into decomposed matrix products, capturing the dynamic causal structure of high-dimensional data.
  arXiv  Detail & Related papers  (2024-10-25T10:48:41Z)
• Standardizing Structural Causal Models [80.21199731817698]
  We propose internally-standardized structural causal models (iSCMs) for benchmarking algorithms. By construction, iSCMs are not $operatornameVar$-sortable, and as we show experimentally, not $operatornameR2$-sortable either for commonly-used graph families.
  arXiv  Detail & Related papers  (2024-06-17T14:52:21Z)
• Dynamic Structural Causal Models [1.6574413179773764]
  We show that certain systems of Differential Equations (SDEs) can be appropriately represented with DSCMs. An immediate consequence of this construction is a graphical Markov property for systems of SDEs. We also define a subsampling operation, which returns a discrete-time DSCM, and which can be used for mathematical analysis of subsampled time-series.
  arXiv  Detail & Related papers  (2024-06-03T09:54:31Z)
• Tensor network renormalization: application to dynamic correlation functions and non-hermitian systems [0.0]
  We present the implementation of the Loop-TNR algorithm, which allows for the computation of dynamical correlation functions. We highlight that the Loop-TNR algorithm can also be applied to investigate critical properties of non-Hermitian systems.
  arXiv  Detail & Related papers  (2023-11-30T18:34:32Z)
• CUTS+: High-dimensional Causal Discovery from Irregular Time-series [13.84185941100574]
  We propose CUTS+, which is built on the Granger-causality-based causal discovery method CUTS. We show that CUTS+ largely improves the causal discovery performance on high-dimensional data with different types of irregular sampling.
  arXiv  Detail & Related papers  (2023-05-10T04:20:36Z)
• 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)
• ER: Equivariance Regularizer for Knowledge Graph Completion [107.51609402963072]
  We propose a new regularizer, namely, Equivariance Regularizer (ER) ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods.
  arXiv  Detail & Related papers  (2022-06-24T08:18:05Z)
• Amortized Inference for Causal Structure Learning [72.84105256353801]
  Learning causal structure poses a search problem that typically involves evaluating structures using a score or independence test. We train a variational inference model to predict the causal structure from observational/interventional data. Our models exhibit robust generalization capabilities under substantial distribution shift.
  arXiv  Detail & Related papers  (2022-05-25T17:37:08Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• 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)

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.