pith. sign in

arxiv: 2302.07458 · v1 · pith:5RQKL7BOnew · submitted 2023-02-15 · 💻 cs.LG · stat.ME

CUTS: Neural Causal Discovery from Irregular Time-Series Data

classification 💻 cs.LG stat.ME
keywords datacausaldiscoveryneuralcutstime-seriesapplicationsexisting
0
0 comments X
read the original abstract

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 neural networks. However, most existing methods assume structured input data and degenerate greatly when encountering data with randomly missing entries or non-uniform sampling frequencies, which hampers their applications in real scenarios. To address this issue, here we present CUTS, a neural Granger causal discovery algorithm to jointly impute unobserved data points and build causal graphs, via plugging in two mutually boosting modules in an iterative framework: (i) Latent data prediction stage: designs a Delayed Supervision Graph Neural Network (DSGNN) to hallucinate and register unstructured data which might be of high dimension and with complex distribution; (ii) Causal graph fitting stage: builds a causal adjacency matrix with imputed data under sparse penalty. Experiments show that CUTS effectively infers causal graphs from unstructured time-series data, with significantly superior performance to existing methods. Our approach constitutes a promising step towards applying causal discovery to real applications with non-ideal observations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. CausalCompass: Evaluating the Robustness of Time-Series Causal Discovery in Misspecified Scenarios

    cs.LG 2026-02 unverdicted novelty 7.0

    CausalCompass benchmarks TSCD methods across eight misspecification scenarios and finds deep learning approaches generally outperform others, with no single method dominating all cases.