Meta-D2AG: Causal Graph Learning with Interventional Dynamic Data

Songtao Lu (The Chinese University of Hong Kong) · Tian Gao (IBM Research) · Junkyu Lee (IBM) · Elliot Nelson (International Business Machines) · Debarun Bhattacharjya (IBM Research) · Yue Yu (National University of Defense Technology) · Miao Liu (Tsinghua University)
benchmark datasetscausal discoveryconvergence analysisdirected acyclic graphdistribution shiftsdomain adaptationdynamic time seriesexternal interventionsfirst-order optimizationidentifiability conditionsnon-stationary datanonlinear datasetsonline meta-learningsample efficiencytemporal transition

Causal discovery in the form of a directed acyclic graph (DAG) for dynamic time series data has been widely studied in various applications. Much of the existing work has focused on observational, offline, and/or stationary settings. In this work, we propose a dynamic DAG discovery algorithm, Meta-D$^2$AG, based on online meta-learning. Meta-D$^2$AG is designed to learn dynamic DAG structures from potentially nonlinear and non-stationary times series datasets, accounting for changes in both parameters and graph structures. Notably, Meta-D$^2$AG explicitly treats data collected at different time points with distribution shifts as distinct domains, which is assumed to occur as a result of external interventions. Moreover, Meta-D$^2$AG contains a new online meta-learning framework to take advantage of the temporal transition among existing domains such that it can quickly adapt to new domains with few measurements. A first-order optimization approach is utilized to efficiently solve the meta-learning framework, and theoretical analysis establishes the identifiability conditions and the convergence of the learning process. We demonstrate the promising performance of our method through better accuracy and sample efficiency on benchmark datasets against state-of-the-art baselines.