Active Structure Learning of Bayesian Networks in an Observational Setting

by   Noa Ben-David, et al.

We study active structure learning of Bayesian networks in an observational setting, in which there are external limitations on the number of variable values that can be observed from the same sample. Random samples are drawn from the joint distribution of the network variables, and the algorithm iteratively selects which variables to observe in the next sample. We propose a new active learning algorithm for this setting, that finds with a high probability a structure with a score that is ϵ-close to the optimal score. We show that for a class of distributions that we term stable, a sample complexity reduction of up to a factor of Ω(d^3) can be obtained, where d is the number of network variables. We further show that in the worst case, the sample complexity of the active algorithm is guaranteed to be almost the same as that of a naive baseline algorithm. To supplement the theoretical results, we report experiments that compare the performance of the new active algorithm to the naive baseline and demonstrate the sample complexity improvements. Code for the algorithm and for the experiments is provided at



There are no comments yet.


page 1

page 2

page 3

page 4


Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity

Learning the directed acyclic graph (DAG) structure of a Bayesian networ...

On the Sample Complexity of Learning Bayesian Networks

In recent years there has been an increasing interest in learning Bayesi...

Learning Sparse Fixed-Structure Gaussian Bayesian Networks

Gaussian Bayesian networks (a.k.a. linear Gaussian structural equation m...

Efficiently Learning and Sampling Interventional Distributions from Observations

We study the problem of efficiently estimating the effect of an interven...

Incorporating Type II Error Probabilities from Independence Tests into Score-Based Learning of Bayesian Network Structure

We give a new consistent scoring function for structure learning of Baye...

Active Learning for Contextual Search with Binary Feedbacks

In this paper, we study the learning problem in contextual search, which...

Learning causal Bayes networks using interventional path queries in polynomial time and sample complexity

Causal discovery from empirical data is a fundamental problem in many sc...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.