- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes DCD-PFN, an approach for causal structure learning from observational data. Building on the decoupled causal discovery (DCD) framework and its Markov boundary (MB)-based reconstruction theory, the authors explore whether local MB discovery can be amortized through pre-training. Specifically, DCD-PFN learns sample-wise decoupling weights and predicts MBs from observational data, which are then used in a parallelized local-to-global procedure to reconstruct a CPDAG. The method is validated on synthetic and real-world datasets.
Critical strengths
The paper proposes a PFN-based Markov boundary (MB) learning method and further integrates it with the existing DCD framework for causal structure learning.
Critical weaknesses
-
The practical scope of the method is limited. Although the paper is motivated by robust causal discovery, the reconstruction framework assumes the absence of unobserved confounders. This strong assumption limits its applicability. Moreover, although computational efficiency is an important motivation, no runtime or scalability results are reported.
-
The main new component is not directly compared with existing MB discovery methods. The major contribution of the paper is the PFN-based MB learner, yet the experiments do not compare it against existing Markov boundary discovery algorithms.
-
The proposed learned MB predictor itself lacks theoretical guarantees. The paper does not establish soundness, completeness, consistency, or error bounds for the PFN-based MB identification procedure.
-
The reconstruction procedure lacks a sufficiently explicit theoretical guarantee in this paper. The paper does not clearly state the soundness and completeness guarantees for Algorithm 1. In addition, the correctness of adjacency recovery and v-structure identification is not explicitly justified.
-
The empirical evaluation is limited and does not sufficiently validate the claimed robustness and efficiency. The experiments are restricted to relatively small and sparse graphs, and no results are provided on larger or denser structures, or in settings with unobserved confounding.
Questions for authors
Please see the weaknesses above for my main concerns.
Some closely related literature on local-to-global causal structure learning is not discussed, e.g., Local-to-Global Bayesian Network Structure Learning (ICML 2017) and A Recursive Method for Structural Learning of Directed Acyclic Graphs (JMLR 2008).
3 comments
Thank you for the response. However, most of my major concerns remain unresolved in the current version, and addressing them is essential to the completeness of the work. Therefore, I will maintain my original rating.
Thank you for your reply. We are sorry that our previous response did not fully address your concerns. We would greatly appreciate it if you could point out which specific part remains unresolved, so that we can provide further clarification. Thank you again for your time and feedback.
Response to Reviewer vB4U
We sincerely appreciate your time and effort in reviewing our paper. Below, we provide detailed responses to your comments. If anything remains unclear or if you have further questions, please do not hesitate to let us know.
As a new causal discovery method, establishing our methodology under the causal sufficiency assumption serves as a reasonable and standard starting point. Extending this framework to settings with latent variables is a natural next step, which we are actively investigating.
Since the ultimate target of our method is the global causal structure, our experiments primarily compare with representative methods across major causal discovery paradigms. Following your suggestion, we have supplemented the evaluation (revised manuscript, Appendix A.7) with variants replacing our MB discovery module with the original DCD [1] and two alternative MB discovery algorithms (GS [2] and IA [3], equipped with KCIT) on the real-world Sachs Flow-Cytometry dataset n=1755:
(DCD-PFN was run on a single RTX 5090 GPU, while the other methods were executed on CPUs.)
Compared with other MB discovery methods, our method exhibits clear performance advantages. Regarding efficiency, our method achieves a total runtime of 1.57 seconds, representing an improvement of 2–3 orders of magnitude over the original DCD. The speedup is even more pronounced when compared against MB discovery methods employing non-parametric KCIT.
MB Identifiability via decoupling: This theoretical foundation has already been established in [1], which directly inspired our work (as noted in lines 105–107).
Direct theoretical guarantees of pre-trained PFN models: We agree that this is a critical and currently under-explored frontier question. While establishing general guarantees for pre-trained PFNs is a substantial undertaking on its own, we consider it an important direction for future theoretical work.
As a parallelized variant, Algorithm 1 preserves the theoretical guarantees (i.e., soundness and completeness) established in [1]. We have briefly noted this in lines 256–258 (right after the assumptions) and will highlight this property more clearly in the revised manuscript.
Our empirical evaluation already includes synthetic data, semi-synthetic data based on real graphs, and the widely used real-world Sachs dataset, which we believe aligns with the established practices of causal discovery literature. If you have any further suggestions regarding specific datasets to test, please feel free to let us know.
Our related work initially focused primarily on the developing areas of PFNs and amortized causal discovery over recent years. Thank you again for pointing this out, we have incorporated these relevant local-to-global works into Section 2.2 of the revised manuscript.
[1] Zhengkang Guan, Fei Wu, Kun Kuang. Decoupled Causal Discovery. ArXiv, 2026
[2] Dimitris Margaritis, Sebastian Thrun. Bayesian Network Induction via Local Neighborhoods. NIPS, 1999.
[3] Ioannis Tsamardinos, Constantin F. Aliferis, and Alexander Statnikov. Algorithms for Large Scale Markov Blanket Discovery. FLAIRS, 2003.