pith. sign in

arxiv: 2507.07898 · v1 · pith:LAUGMXNRnew · submitted 2025-07-10 · 💻 cs.LG · stat.AP

Efficient Causal Discovery for Autoregressive Time Series

classification 💻 cs.LG stat.AP
keywords algorithmcausalefficientseriestimeautoregressivedatanonlinear
0
0 comments X
read the original abstract

In this study, we present a novel constraint-based algorithm for causal structure learning specifically designed for nonlinear autoregressive time series. Our algorithm significantly reduces computational complexity compared to existing methods, making it more efficient and scalable to larger problems. We rigorously evaluate its performance on synthetic datasets, demonstrating that our algorithm not only outperforms current techniques, but also excels in scenarios with limited data availability. These results highlight its potential for practical applications in fields requiring efficient and accurate causal inference from nonlinear time series data.

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. GRACE: Gated Refinement for Accurate Causal Edge Discovery in High-Dimensional Time Series

    cs.LG 2026-06 unverdicted novelty 5.0

    GRACE uses Hard Concrete gates and L0 regularization to prune false positives from a linear CI skeleton in high-dimensional time series causal discovery, improving F1 scores and speed over baselines.