[2603.05370] Learning Causal Structure of Time Series using Best Order Score Search
About this article
Abstract page for arXiv paper 2603.05370: Learning Causal Structure of Time Series using Best Order Score Search
Computer Science > Machine Learning arXiv:2603.05370 (cs) [Submitted on 5 Mar 2026] Title:Learning Causal Structure of Time Series using Best Order Score Search Authors:Irene Gema Castillo Mansilla, Urmi Ninad View a PDF of the paper titled Learning Causal Structure of Time Series using Best Order Score Search, by Irene Gema Castillo Mansilla and 1 other authors View PDF Abstract:Causal structure learning from observational data is central to many scientific and policy domains, but the time series setting common to many disciplines poses several challenges due to temporal dependence. In this paper we focus on score-based causal discovery for multivariate time series and introduce TS-BOSS, a time series extension of the recently proposed Best Order Score Search (BOSS) (Andrews et al. 2023). TS-BOSS performs a permutation-based search over dynamic Bayesian network structures while leveraging grow-shrink trees to cache intermediate score computations, preserving the scalability and strong empirical performance of BOSS in the static setting. We provide theoretical guarantees establishing the soundness of TS-BOSS under suitable assumptions, and we present an intermediate result that extends classical subgraph minimality results for permutation-based methods to the dynamic (time series) setting. Our experiments on synthetic data show that TS-BOSS is especially effective in high auto-correlation regimes, where it consistently achieves higher adjacency recall at comparable precisi...