On Local Optima in Learning Bayesian Networks

Abstract

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported showing that KES often finds a better local optima than GES. Moreover, we use KES to experimentally confirm that the number of different local optima is often huge.

Appears in Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI2003)

References in corpus (2)

• A Transformational Characterization of Equivalent Bayesian Network Structures
• Finding Optimal Bayesian Networks

Cited by in corpus (6)

• Large-Sample Learning of Bayesian Networks is NP-Hard
• Learning AMP Chain Graphs under Faithfulness
• Towards Gaussian Bayesian Network Fusion
• Every LWF and AMP chain graph originates from a set of causal models
• Learning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness: Extended Version
• Finding Consensus Bayesian Network Structures