Causal Discovery via Bayesian Optimization
Bao Duong, Sunil Gupta, Thin Nguyen

TL;DR
This paper introduces DrBO, a Bayesian optimization-based framework for causal discovery that efficiently identifies high-scoring DAGs using neural networks, outperforming existing methods in accuracy and computational efficiency.
Contribution
The paper proposes DrBO, a novel DAG learning method utilizing dropout neural networks within Bayesian optimization to improve scalability and accuracy in causal discovery.
Findings
DrBO finds accurate DAGs with fewer evaluations.
It outperforms state-of-the-art methods in synthetic and real data.
It is computationally more efficient and scalable.
Abstract
Existing score-based methods for directed acyclic graph (DAG) learning from observational data struggle to recover the causal graph accurately and sample-efficiently. To overcome this, in this study, we propose DrBO (DAG recovery via Bayesian Optimization)-a novel DAG learning framework leveraging Bayesian optimization (BO) to find high-scoring DAGs. We show that, by sophisticatedly choosing the promising DAGs to explore, we can find higher-scoring ones much more efficiently. To address the scalability issues of conventional BO in DAG learning, we replace Gaussian Processes commonly employed in BO with dropout neural networks, trained in a continual manner, which allows for (i) flexibly modeling the DAG scores without overfitting, (ii) incorporation of uncertainty into the estimated scores, and (iii) scaling with the number of evaluations. As a result, DrBO is computationally efficient…
Peer Reviews
Decision·ICLR 2025 Poster
Learning DAG from data using BO is novel and interesting. The authors overcome the scalability issue of conventional BO by leveraging dropout in neural networks. Experimental results show that the proposed method is effective and can achieve improved results. The paper was written with technical details.
N/A
- This paper is written clearly, with clear and detailed descriptions of their method and experiments. - They performed extensive experiments for validation.
- While there exist some causal discovery algorithms with Bayesian optimization, it seems not proper to state “To our knowledge, this is the first score-based causal discovery method based on BO ”. I think it should be corrected. - Throughout the paper, from the experiments, it is demonstrated that the proposed method can give better performances in both accuracy, sample-efficiency, and scalability, compared with other SOTA baselines. Generally, such a great method needs more assumptions or con
- The paper is well written and easy to follow. - Developing effective search procedure for score-based causal discovery is an interesting and important topic. The proposed method adopts various design choices and is practical. - The search method is reasonable. - The empirical studies demonstrate that the proposed method considerably outperforms existing methods.
- Some of the baselines considered are not adequate. - Some of the results may seem too good to be true. For example, achieving a SHD of 1.6 with only 1000 samples across 30 nodes and 240 edges seems highly challenging due to finite sample error. This concern is especially relevant when dealing with nonlinear data. (I look forward to the authors' clarification/explanation on this, and please correct me if I misunderstood anything.)
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference
MethodsSparse Evolutionary Training · Dropout
