Causal Graph Discovery from Self and Mutually Exciting Time Series
We present a generalized linear structural causal model, coupled with a novel data-adaptive linear regularization, to recover causal directed acyclic graphs (DAGs) from time series. By leveraging a recently developed stochastic monotone Variational Inequality (VI) formulation, we cast the causal discovery problem as a general convex optimization. Furthermore, we develop a non-asymptotic recovery guarantee and quantifiable uncertainty by solving a linear program to establish confidence intervals for a wide range of non-linear monotone link functions. We validate our theoretical results and show the competitive performance of our method via extensive numerical experiments. Most importantly, we demonstrate the effectiveness of our approach in recovering highly interpretable causal DAGs over Sepsis Associated Derangements (SADs) while achieving comparable prediction performance to powerful ``black-box'' models such as XGBoost. Thus, the future adoption of our proposed method to conduct continuous surveillance of high-risk patients by clinicians is much more likely.
Code (0)
등록된 구현이 없습니다.
Tasks
Causal Discoveryfeature selectionTime SeriesTime Series AnalysisMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Causal Graph Discovery from Self and Mutually Exciting Time Series
We present a generalized linear structural causal model, coupled with a novel data-adaptive linear regularization, to recover causal directed acyclic graphs (DAGs) from time series. By leveraging a recently developed sto…
Causal DiscoveryTime SeriesTime Series AnalysisCUTS: Neural Causal Discovery from Irregular Time-Series Data
Causal discovery from time-series data has been a central task in machine learning. Recently, Granger causality inference is gaining momentum due to its good explainability and high compatibility with emerging deep neura…
Causal DiscoveryGraph Neural NetworkIrregular Time SeriesTime Series+1Mutually exciting point process graphs for modelling dynamic networks
A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG). MEG is a scalable network-wide statistical model for point processes with dyadic marks, which can be used for a…
Anomaly DetectionPoint ProcessesSelf and mutually exciting point process embedding flexible residuals and intensity with discretely Markovian dynamics
This work introduces a self and mutually exciting point process that embeds flexible residuals and intensity with discretely Markovian dynamics. By allowing the integration of diverse residual distributions, this model s…
Time SeriesCausal Discovery for Linear DAGs with Dependent Latent Variables via Higher-order Cumulants
This paper addresses the problem of estimating causal directed acyclic graphs in linear non-Gaussian acyclic models with latent confounders (LvLiNGAM). Existing methods assume mutually independent latent confounders or c…