Computational Investigation of Low-Discrepancy Sequences in Simulation Algorithms for Bayesian Networks

Abstract

Monte Carlo sampling has become a major vehicle for approximate inference in Bayesian networks. In this paper, we investigate a family of related simulation approaches, known collectively as quasi-Monte Carlo methods based on deterministic low-discrepancy sequences. We first outline several theoretical aspects of deterministic low-discrepancy sequences, show three examples of such sequences, and then discuss practical issues related to applying them to belief updating in Bayesian networks. We propose an algorithm for selecting direction numbers for Sobol sequence. Our experimental results show that low-discrepancy sequences (especially Sobol sequence) significantly improve the performance of simulation algorithms in Bayesian networks compared to Monte Carlo sampling.

Appears in Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI2000)

References in corpus (1)

• Faster Evaluation of Multidimensional Integrals

Cited by in corpus (4)

• A unified deep artificial neural network approach to partial differential equations in complex geometries
• Refractor Importance Sampling
• A machine learning approach to predict near-optimal meshes for turbulent compressible flow simulations
• Characterizing the Nonlinearity of Power System Generator Models