跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.04081 · v3

Time series causal discovery with variable lags

首次提交 2026-04-15 17:29
版本更新 2026-11-13 10:26
雷达观测 2026-11-17 04:57
arXiv ↗PDF ↗

摘要

Causal Bayesian Networks (CBNs) are a powerful tool for reasoning under uncertainty about complex real-world problems. Such problems evolve over time, responding to external shocks as they occur. To support decision-making, CBNs require a cause-and-effect map of the variables under consideration, known as the network's structure. Learning the graphical structure of a causal model from data remains challenging; learning it from time-series data is even harder because dependencies may arise at different time lags. We construct a method that jointly learns a temporal ordering and a dominant lag for each selected ordered variable pair. Our contribution is a decomposable BIC-style objective score for mixed data that combines node-specific sample sizes with a penalty favouring recent lags. We optimise this objective using a Tabu search augmented with change-lag moves and greedy per-child lag tuning, while its node-wise decomposition supports cached and parallel neighbourhood evaluation. We establish acyclicity and complexity results and derive recovery limits when effects are distributed across multiple lags. In simulations, we show that the proposed method outperforms an inflexible lag-1 score-based learner in most evaluated settings, whereas most specialised methods achieve higher recovery accuracy on data that satisfy their assumptions. On a real-world UK COVID-19 dataset, the method learnt an expected short-lag-skewed structure; nevertheless, 46.8% of selected edges had lags greater than one, showing that longer delays can be retained when their improved fit offsets the penalty. Under its no-contemporaneous-edges and causal-sufficiency assumptions, the method provides a computationally tractable subroutine for edge-specific single-lag optimisation, complementing score-based causal discovery methods.

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

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

v3 · 2026-11-13 10:26 · 最新观测版本

Time series causal discovery with variable lags

Causal Bayesian Networks (CBNs) are a powerful tool for reasoning under uncertainty about complex real-world problems. Such problems evolve over time, responding to external shocks as they occur. To support decision-making, CBNs require a cause-and-effect map of the variables under consideration, known as the network's structure. Learning the graphical structure of a causal model from data remains challenging; learning it from time-series data is even harder because dependencies may arise at different time lags. We construct a method that jointly learns a temporal ordering and a dominant lag for each selected ordered variable pair. Our contribution is a decomposable BIC-style objective score for mixed data that combines node-specific sample sizes with a penalty favouring recent lags. We optimise this objective using a Tabu search augmented with change-lag moves and greedy per-child lag tuning, while its node-wise decomposition supports cached and parallel neighbourhood evaluation. We establish acyclicity and complexity results and derive recovery limits when effects are distributed across multiple lags. In simulations, we show that the proposed method outperforms an inflexible lag-1 score-based learner in most evaluated settings, whereas most specialised methods achieve higher recovery accuracy on data that satisfy their assumptions. On a real-world UK COVID-19 dataset, the method learnt an expected short-lag-skewed structure; nevertheless, 46.8% of selected edges had lags greater than one, showing that longer delays can be retained when their improved fit offsets the penalty. Under its no-contemporaneous-edges and causal-sufficiency assumptions, the method provides a computationally tractable subroutine for edge-specific single-lag optimisation, complementing score-based causal discovery methods.

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