- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes HiBCD, a Bayesian causal discovery method for high-dimensional data. The method follows a divide-and-conquer strategy that repeatedly samples small subsets of variables, predicts local ancestral relations using a pre-trained amortized estimator, and aggregates the resulting local ordering information into a global causal order. Given the inferred global orders, the method further performs Bayesian edge scoring and model averaging to recover a global DAG. The method is evaluated on synthetic linear and nonlinear datasets as well as several benchmark Bayesian networks.
Critical strengths
The paper presents an interesting divide-and-conquer approach to scaling Bayesian causal discovery. In particular, predicting local ancestral relations rather than direct edges is a reasonable design choice when variables outside a sampled subset are effectively unobserved in the local problem. The empirical results also show promising structural recovery performance on graphs with hundreds of variables.
Critical weaknesses
-
The key local ancestral inference step lacks theoretical justification. The paper does not establish when ancestral relations in the full DAG are identifiable from the marginal distribution over a sampled subset, particularly when variables outside the subset induce latent confounding.
-
The local-to-global reconstruction lacks sufficient theoretical guarantees. The sampler guarantees node coverage, but not sufficient pairwise coverage, and no consistency guarantees are provided for recovering the global causal order or graph from local ancestral predictions.
-
The Bayesian interpretation of the framework is not fully justified. The local objective is a variational surrogate rather than an ELBO, while the final graph is obtained through order aggregation, consensus projection, and thresholding. It is therefore unclear whether the resulting probabilities can be interpreted as a well-defined posterior over causal graphs.
-
The scalability evaluation is incomplete. Although scalability is a central motivation of the paper, no quantitative runtime comparison with the competing methods is provided. Figure 2 only reports the runtime of HiBCD, and the efficiency evaluation further uses , whereas the main nonlinear experiments use . More importantly, several relevant baselines are missing, including Dong et al. (2025), Gu & Zhou (2020), Fast Scalable and Accurate Discovery of DAGs Using the Best Order Score Search and Grow-Shrink Trees (NeurIPS 2023), Large-Scale Differentiable Causal Discovery of Factor Graphs (NeurIPS 2022), and Effective Bayesian Causal Inference via Structural Marginalisation and Autoregressive Orders (AISTATS 2025). The first two are already discussed in the paper as motivating large-scale causal discovery methods.
-
The empirical evaluation does not sufficiently validate the claimed robustness and generality. The synthetic experiments are mainly limited to sparse ER DAGs with additive Gaussian noise. In addition, different baselines use different sample sizes and evaluation protocols, while the real-world benchmarks employ substantially different dataset-specific hyperparameters, making the empirical comparisons less controlled.
Questions for authors
Please see the weaknesses above for my main concerns.
Could the authors further validate the method on genuinely real high-dimensional biological data? For example, the Perturb-CITE-seq dataset from Multimodal pooled Perturb-CITE-seq screens in patient models define mechanisms of cancer immune evasion (Nature Genetics, 2021).