- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a technique for Bayesian Network learning wherein a set of variables is chosen that d-separates the remaining nodes into conditionally independent sets over which learning is easier. The separating variables are called a shield and the technique shield-induced partitioning. The approach can be applied recursively. The paper performs experiments across a wide range of benchmarks using a standard Bayesian Network learning package.
Critical strengths
It is interesting to see a paper that proposes a principled approach to Bayesian Network learning in the current research climate, and still making contributions that are theoretically justified in this mature field. Moreover, the experiments suggest that the approach is a promising direction for structure learning.
Critical weaknesses
I have three main concerns about the paper. First, the idea of separating variables appears to overlap with the concept of Markov blankets and cut sets, yet these are never mentioned in the paper. Can the authors comment on the similarity and key differences?
Second, the paper does not discuss parameter learning. How is this done during structure elicitation?
Last, the paper fails to compare against some important other BN structure learning approaches such as:
- Bach and Jordan, "Thin junction trees", NeurIPS, 2001
- Elidan and Gould, "Learning Bounded Treewidth Bayesian Networks", NeurIPS, 2008
Questions for authors
Please address the three concerns raised above.
We would appreciate your thoughts on our corrected proof and additional experiments. Do these address your concerns, or does a specific issue remain decisive for your recommendation? If your concerns have been resolved, we would be grateful if you would reconsider your rating.