Causal Discovery in Hawkes Processes by Minimum Description Length

• URL: http://arxiv.org/abs/2206.06124v1
• Date: Fri, 10 Jun 2022 10:16:03 GMT
• Title: Causal Discovery in Hawkes Processes by Minimum Description Length
• Authors: Amirkasra Jalaldoust, Katerina Hlavackova-Schindler, Claudia Plant
• Abstract summary: Hawkes processes are a class of temporal point processes which exhibit a natural notion of causality. This paper approaches the problem of learning Granger-causal network in multi-dimensional Hawkes processes. We compare our algorithm with the state-of-the-art baseline methods on synthetic and real-world financial data.
• Score: 11.627871646343502
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hawkes processes are a special class of temporal point processes which exhibit a natural notion of causality, as occurrence of events in the past may increase the probability of events in the future. Discovery of the underlying influence network among the dimensions of multi-dimensional temporal processes is of high importance in disciplines where a high-frequency data is to model, e.g. in financial data or in seismological data. This paper approaches the problem of learning Granger-causal network in multi-dimensional Hawkes processes. We formulate this problem as a model selection task in which we follow the minimum description length (MDL) principle. Moreover, we propose a general algorithm for MDL-based inference using a Monte-Carlo method and we use it for our causal discovery problem. We compare our algorithm with the state-of-the-art baseline methods on synthetic and real-world financial data. The synthetic experiments demonstrate superiority of our method incausal graph discovery compared to the baseline methods with respect to the size of the data. The results of experiments with the G-7 bonds price data are consistent with the experts knowledge.

Related papers

• TS-CausalNN: Learning Temporal Causal Relations from Non-linear Non-stationary Time Series Data [0.42156176975445486]
  We propose a Time-Series Causal Neural Network (TS-CausalNN) to discover contemporaneous and lagged causal relations simultaneously. In addition to the simple parallel design, an advantage of the proposed model is that it naturally handles the non-stationarity and non-linearity of the data.
  arXiv  Detail & Related papers  (2024-04-01T20:33:29Z)
• Multi-modal Causal Structure Learning and Root Cause Analysis [67.67578590390907]
  We propose Mulan, a unified multi-modal causal structure learning method for root cause localization. We leverage a log-tailored language model to facilitate log representation learning, converting log sequences into time-series data. We also introduce a novel key performance indicator-aware attention mechanism for assessing modality reliability and co-learning a final causal graph.
  arXiv  Detail & Related papers  (2024-02-04T05:50:38Z)
• Discovering Mixtures of Structural Causal Models from Time Series Data [23.18511951330646]
  We propose a general variational inference-based framework called MCD to infer the underlying causal models. Our approach employs an end-to-end training process that maximizes an evidence-lower bound for the data likelihood. We demonstrate that our method surpasses state-of-the-art benchmarks in causal discovery tasks.
  arXiv  Detail & Related papers  (2023-10-10T05:13:10Z)
• Granger Causal Inference in Multivariate Hawkes Processes by Minimum Message Length [0.0]
  We propose an optimization criterion and model selection algorithm based on the minimum message length (MML) principle. While most of the state-of-art methods using lasso-type penalization tend to overfitting in scenarios with short time horizons, the proposed MML-based method achieves high F1 scores in these settings.
  arXiv  Detail & Related papers  (2023-09-05T08:13:34Z)
• 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)
• FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels [82.53569355337586]
  This work offers an efficient solution to temporal point processes inference using general parametric kernels with finite support. The method's effectiveness is evaluated by modeling the occurrence of stimuli-induced patterns from brain signals recorded with magnetoencephalography (MEG) Results show that the proposed approach leads to an improved estimation of pattern latency than the state-of-the-art.
  arXiv  Detail & Related papers  (2022-10-10T12:35:02Z)
• MissDAG: Causal Discovery in the Presence of Missing Data with Continuous Additive Noise Models [78.72682320019737]
  We develop a general method, which we call MissDAG, to perform causal discovery from data with incomplete observations. MissDAG maximizes the expected likelihood of the visible part of observations under the expectation-maximization framework. We demonstrate the flexibility of MissDAG for incorporating various causal discovery algorithms and its efficacy through extensive simulations and real data experiments.
  arXiv  Detail & Related papers  (2022-05-27T09:59:46Z)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)
• THP: Topological Hawkes Processes for Learning Granger Causality on Event Sequences [31.895008425796792]
  We propose a Granger causality learning method on Topological Hawkes processes (THP) in a likelihood framework. The proposed method is featured with the graph convolution-based likelihood function of THP and a sparse optimization scheme with an Expectation-Maximization of the likelihood function.
  arXiv  Detail & Related papers  (2021-05-23T08:33:46Z)
• Incorporating Causal Graphical Prior Knowledge into Predictive Modeling via Simple Data Augmentation [92.96204497841032]
  Causal graphs (CGs) are compact representations of the knowledge of the data generating processes behind the data distributions. We propose a model-agnostic data augmentation method that allows us to exploit the prior knowledge of the conditional independence (CI) relations. We experimentally show that the proposed method is effective in improving the prediction accuracy, especially in the small-data regime.
  arXiv  Detail & Related papers  (2021-02-27T06:13:59Z)
• Leveraging Global Parameters for Flow-based Neural Posterior Estimation [90.21090932619695]
  Inferring the parameters of a model based on experimental observations is central to the scientific method. A particularly challenging setting is when the model is strongly indeterminate, i.e., when distinct sets of parameters yield identical observations. We present a method for cracking such indeterminacy by exploiting additional information conveyed by an auxiliary set of observations sharing global parameters.
  arXiv  Detail & Related papers  (2021-02-12T12:23: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.