A constraint optimization approach to causal discovery from subsampled time series data

被引:9
作者
Hyttinen, Antti [1 ]
Plis, Sergey [2 ,3 ]
Jarvisalo, Matti [1 ]
Eberhardt, Frederick [4 ]
Danks, David [5 ]
机构
[1] Univ Helsinki, Dept Comp Sci, HIIT, Helsinki, Finland
[2] Mind Res Network, Albuquerque, NM USA
[3] Univ New Mexico, Albuquerque, NM 87131 USA
[4] CALTECH, Humanities & Social Sci, Pasadena, CA 91125 USA
[5] Carnegie Mellon Univ, Dept Philosophy, Pittsburgh, PA 15213 USA
基金
芬兰科学院;
关键词
Causality; Causal discovery; Graphical models; Time series; Constraint satisfaction; Constraint optimization;
D O I
10.1016/j.ijar.2017.07.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider causal structure estimation from time series data in which measurements are obtained at a coarser timescale than the causal timescale of the underlying system. Previous work has shown that such subsampling can lead to significant errors about the system's causal structure if not properly taken into account. In this paper, we first consider the search for system timescale causal structures that correspond to a given measurement timescale structure. We provide a constraint satisfaction procedure whose computational performance is several orders of magnitude better than previous approaches. We then consider finite-sample data as input, and propose the first constraint optimization approach for recovering system timescale causal structure. This algorithm optimally recovers from possible conflicts due to statistical errors. We then apply the method to real-world data, investigate the robustness and scalability of our method, consider further approaches to reduce underdetermination in the output, and perform an extensive comparison between different solvers on this inference problem. Overall, these advances build towards a full understanding of non-parametric estimation of system timescale causal structures from subsampled time series data. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:208 / 225
页数:18
相关论文
共 37 条
[1]  
[Anonymous], LNCS
[2]  
[Anonymous], 1994, TIME SERIES ANAL
[3]  
[Anonymous], 2005, NEW INTRO MULTIPLE T
[4]  
[Anonymous], 2015, JSAT
[5]  
Ansotegui Carlos, 2013, CPAIOR, V13, P403
[6]  
Audemard G, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P399
[7]  
Biere A., 2016, P SAT COMP 2016 SOLV, P44
[8]   Bounded model checking [J].
Biere, Armin .
Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) :457-481
[9]  
Bjorner N, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P246
[10]  
Danks D., 2013, P NIPS 2013 WORKSH C