跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26232 · v1

Time Series Structure Learning with Local Causal Parent Discovery

首次提交 2026-11-19 23:06
版本更新 2026-11-19 23:06
雷达观测 2026-11-20 14:52
arXiv ↗PDF ↗

摘要

Learning and inference on time series can pose significant statistical challenges, including autocorrelated observations, distribution shift over time, and the curse of dimensionality. These challenges complicate the practical application of causal discovery algorithms, which already suffer from high computational and sample complexity in the general case. To mitigate these issues, this work introduces Iterative Temporal Parent Discovery (ITPD): a sound and complete constraint-based procedure for causal structure learning on multivariate time series with causal nonstationarity. ITPD takes a local-to-global learning approach that discovers the global graph by sequentially discovering the parent set for each variable. ITPD exploits temporal structural priors, graph partitioning, and the local Markov condition to swap higher-order conditional independence tests for lower-order alternatives. With an exact oracle, ITPD performed the least number of tests and used the smallest average conditioning set sizes relative to baselines. In benchmarking simulations, ITPD sat on the Pareto frontier with respect to F1 and wall-clock time and was faster than baselines on large graphs (≥\geq 1000 nodes). For graphs with 2000 nodes, ITPD ran 2.3×2.3\times, 9.1×9.1\times, and 40.9×40.9\times faster than iterative IAMB, DF-PC, and PCMCI, respectively.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 23:06 · 最新观测版本

Time Series Structure Learning with Local Causal Parent Discovery

Learning and inference on time series can pose significant statistical challenges, including autocorrelated observations, distribution shift over time, and the curse of dimensionality. These challenges complicate the practical application of causal discovery algorithms, which already suffer from high computational and sample complexity in the general case. To mitigate these issues, this work introduces Iterative Temporal Parent Discovery (ITPD): a sound and complete constraint-based procedure for causal structure learning on multivariate time series with causal nonstationarity. ITPD takes a local-to-global learning approach that discovers the global graph by sequentially discovering the parent set for each variable. ITPD exploits temporal structural priors, graph partitioning, and the local Markov condition to swap higher-order conditional independence tests for lower-order alternatives. With an exact oracle, ITPD performed the least number of tests and used the smallest average conditioning set sizes relative to baselines. In benchmarking simulations, ITPD sat on the Pareto frontier with respect to F1 and wall-clock time and was faster than baselines on large graphs (≥\geq 1000 nodes). For graphs with 2000 nodes, ITPD ran 2.3×2.3\times, 9.1×9.1\times, and 40.9×40.9\times faster than iterative IAMB, DF-PC, and PCMCI, respectively.

查看此版本解读 →查看此版本原文 ↗