Interventional Causal Structure Discovery over Graphical Models with Convergence and Optimality Guarantees
Not on the map. Why?
Abstract (arXiv)
Learning causal structure from sampled data is a fundamental problem with applications in various fields, including healthcare, machine learning and artificial intelligence. Traditional methods predominantly rely on observational data, but there exist limits regarding the identifiability of causal structures with only observational data. Interventional data, on the other hand, helps establish a cause-and-effect relationship by breaking the influence of confounding variables. It remains to date under-explored to develop a mathematical framework that seamlessly integrates both observational and interventional data in causal structure learning. Furthermore, existing studies often focus on centralized approaches, necessitating the transfer of entire datasets to a single server, which lead to considerable communication overhead and heightened risks to privacy. To tackle these challenges, we develop a bilevel polynomial optimization (Bloom) framework. Bloom not only provides a powerful mathematical modeling framework, underpinned by theoretical support, for causal structure discovery from both interventional and observational data, but also aspires to an efficient causal discovery algorithm with convergence and optimality guarantees. We further extend Bloom to a distributed setting to reduce the communication overhead and mitigate data privacy risks. It is seen through experiments on both synthetic and real-world datasets that Bloom markedly surpasses other leading learning algorithms.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 41 of its 81 references that are in the map. First posted on arXiv 9 Aug 2024.
Builds on
41 of 81 references.
References · 41
- 2021Convex optimizationcited by 2,479
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 329
- 2020Counterfactual VQA: A Cause-Effect Look at Language Biascited by 266
- 2017Sparse Communication for Distributed Gradient Descentcited by 243
- 2017Detecting causal associations in large nonlinear time series datasetscited by 240
- 2019Gradient-Based Neural DAG Learningcited by 227
- 2020Differentiable Causal Discovery from Interventional Datacited by 218
- 2019Learning Sparse Nonparametric DAGscited by 207
- 2019Client-Edge-Cloud Hierarchical Federated Learningcited by 202
- 2021Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Gamecited by 159
29 more
- 2019Causal Discovery with Reinforcement Learningcited by 145
- 2018A Sufficient Condition for Convergences of Adam and RMSPropcited by 124
- 2019Learning Neural Causal Models from Unknown Interventionscited by 113
- 2016On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimizationcited by 108
- 2018Which Neural Net Architectures Give Rise To Exploding and Vanishing Gradients?cited by 94
- 2019Masked Gradient-Based Causal Structure Learningcited by 89
- 2022Amortized Inference for Causal Structure Learningcited by 89
- 2021Efficient Neural Causal Discovery without Acyclicity Constraintscited by 82
- 2017Permutation-based Causal Inference Algorithms with Interventionscited by 78
- 2018Characterizing and Learning Equivalence Classes of Causal DAGs under Interventionscited by 76
- 2017Conditional independence testing based on a nearest-neighbor estimator of conditional mutual informationcited by 70
- 2019Permutation-Based Causal Structure Learning with Unknown Intervention Targetscited by 69
- 2020DAGs with No Fears: A Closer Look at Continuous Optimization for Learning Bayesian Networkscited by 66
- 2019On Safeguarding Privacy and Security in the Framework of Federated Learningcited by 55
- 2014Constraint-based Causal Discovery from Multiple Interventions over Overlapping Variable Setscited by 48
- 2020On the Convergence of Continuous Constrained Optimization for Structure Learningcited by 38
- 2019Scalable Semidefinite Programmingcited by 36
- 2023Structure Learning with Continuous Optimization: A Sober Look and Beyondcited by 34
- 2021Towards Federated Bayesian Network Structure Learning with Continuous Optimizationcited by 31
- 2021FedDAG: Federated DAG Structure Learningcited by 17
- 2023Optimizing NOTEARS Objectives via Topological Swapscited by 17
- 2024Federated Causal Discovery from Heterogeneous Datacited by 15
- 2019TSSOS: A Moment-SOS hierarchy that exploits term sparsitycited by 14
- 2023Computably Continuous Reinforcement-Learning Objectives are PAC-learnablecited by 13
- 2022Characterization and Greedy Learning of Gaussian Structural Causal Models under Unknown Interventionscited by 12
- 2022Towards Privacy-Aware Causal Structure Learning in Federated Settingcited by 11
- 2023Global Optimality in Bivariate Gradient-based DAG Learningcited by 10
- 2021On Faster Convergence of Scaled Sign Gradient Descentcited by 6
- 2015Distributed Semidefinite Programming with Application to Large-scale System Analysiscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026A Survey on Federated Causal Discovery and Inferencecited by 0
- 2026A Survey on Federated Causal Discovery and Inference21 Jun 2026