3 years ago

Learning Binary Bayesian Networks in Polynomial Time and Sample Complexity.

Adarsh Barik, Jean Honorio

We consider the problem of structure learning for binary Bayesian networks. Our approach is to recover the true parents and children for each node first and then combine the results to recover the skeleton. We do not assume any specific conditional probability distribution for the nodes. Rather, we show that if the expectations of products of node pairs satisfy certain conditions then we can do exact recovery of parents and children of a node by performing l_1-regularized linear regression with sufficient number of samples. The sample complexity of our proposed approach depends logarithmically on number of nodes in the Bayesian network. Furthermore, our method runs in polynomial time.

Publisher URL: http://arxiv.org/abs/1803.04087

DOI: arXiv:1803.04087v2

You might also like
Never Miss Important Research

Researcher is an app designed by academics, for academics. Create a personalised feed in two minutes.
Choose from over 15,000 academics journals covering ten research areas then let Researcher deliver you papers tailored to your interests each day.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.