Learning discrete Bayesian networks in polynomial time and sample complexity

Adarsh Barik, Jean Honorio

In this paper, we study the problem of structure learning for Bayesian networks in which nodes take discrete values. The problem is NP-hard in general but we show that under certai…