paper-with-me

홈 › Papers

Causal Ordering for Structure Learning from Time Series

2025-10-28 · Pedro P. Sanchez, Damian Machlanski, Steven McDonagh, Sotirios A. Tsaftaris arxiv

Predicting causal structure from time series data is crucial for understanding complex phenomena in physiology, brain connectivity, climate dynamics, and socio-economic behaviour. Causal discovery in time series is hindered by the combinatorial complexity of identifying true causal relationships, especially as the number of variables and time points grow. A common approach to simplify the task is the so-called ordering-based methods. Traditional ordering methods inherently limit the representational capacity of the resulting model. In this work, we fix this issue by leveraging multiple valid causal orderings, instead of a single one as standard practice. We propose DOTS (Diffusion Ordered Temporal Structure), using diffusion-based causal discovery for temporal data. By integrating multiple orderings, DOTS effectively recovers the transitive closure of the underlying directed acyclic graph, mitigating spurious artifacts inherent in single-ordering approaches. We formalise the problem under standard assumptions such as stationarity and the additive noise model, and leverage score matching with diffusion processes to enable efficient Hessian estimation. Extensive experiments validate the approach. Empirical evaluations on synthetic and real-world datasets demonstrate that DOTS outperforms state-of-the-art baselines, offering a scalable and robust approach to temporal causal discovery. On synthetic benchmarks ($d{=}\!3-\!6$ variables, $T{=}200\!-\!5{,}000$ samples), DOTS improves mean window-graph $F1$ from $0.63$ (best baseline) to $0.81$. On the CausalTime real-world benchmark ($d{=}20\!-\!36$), while baselines remain the best on individual datasets, DOTS attains the highest average summary-graph $F1$ while halving runtime relative to graph-optimisation methods. These results establish DOTS as a scalable and accurate solution for temporal causal discovery.

📄 PDF Abstract BibTeX arXiv:2510.24639

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Heteroscedastic Causal Structure Learning

2023-07-16 · Bao Duong, Thin Nguyen

Heretofore, learning the directed acyclic graphs (DAGs) that encode the cause-effect relationships embedded in observational data is a computationally challenging problem. A recent trend of studies has shown that it is p…

valid

From Temporal to Contemporaneous Iterative Causal Discovery in the Presence of Latent Confounders

2023-06-01 · Raanan Y. Rohekar, Shami Nisimov, Yaniv Gurwicz, Gal Novik

We present a constraint-based algorithm for learning causal structures from observational time-series data, in the presence of latent confounders. We assume a discrete-time, stationary structural vector autoregressive pr…

Causal DiscoveryTime Series

A note on the complexity of the causal ordering problem

2015-08-24 · Bernardo Gonçalves, Fabio Porto

In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Si…

Management

Time-Aware Synthetic Control

2026-01-06 · Saeyoung Rho, Cyrus Illick, Samhitha Narasipura, Alberto Abadie 외 arxiv

The synthetic control (SC) framework is widely used for observational causal inference with time-series panel data. SC has been successful in diverse applications, but existing methods typically treat the ordering of pre…

Causal Inference

Execution Flexibility in Automated Planning: A Comparative Evaluation of Deordering and Reordering Strategies

2026-09-15 · Md. Monjurul Islam, Sabah Binte Noor, Fazlul Hasan Siddiqui, Gahangir Hossain arxiv

This study covers foundational concepts for enhancing plan-execution flexibility, including partial-order planning, the producer-consumer-threat formalism, and a range of deordering and reordering strategies. Creating a …