AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks

Abstract

Stochastic sampling algorithms, while an attractive alternative to exact algorithms in very large Bayesian network models, have been observed to perform poorly in evidential reasoning with extremely unlikely evidence. To address this problem, we propose an adaptive importance sampling algorithm, AIS-BN, that shows promising convergence rates even under extreme conditions and seems to outperform the existing sampling algorithms consistently. Three sources of this performance improvement are (1) two heuristics for initialization of the importance function that are based on the theoretical properties of importance sampling in finite-dimensional integrals and the structural advantages of Bayesian networks, (2) a smooth learning method for the importance function, and (3) a dynamic weighting function for combining samples from different stages of the algorithm. We tested the performance of the AIS-BN algorithm along with two state of the art general purpose sampling algorithms, likelihood weighting (Fung & Chang, 1989; Shachter & Peot, 1989) and self-importance sampling (Shachter & Peot, 1989). We used in our tests three large real Bayesian network models available to the scientific community: the CPCS network (Pradhan et al., 1994), the PathFinder network (Heckerman, Horvitz, & Nathwani, 1990), and the ANDES network (Conati, Gertner, VanLehn, & Druzdzel, 1997), with evidence as unlikely as 10^-41. While the AIS-BN algorithm always performed better than the other two algorithms, in the majority of the test cases it achieved orders of magnitude improvement in precision of the results. Improvement in speed given a desired precision is even more dramatic, although we are unable to report numerical results here, as the other algorithms almost never achieved the precision reached even by the first few iterations of the AIS-BN algorithm.

Application of Artificial Intelligence in Prediction of Road Freight Transportation

“…The network activity is based on two fundamental theorems of probability theory: the formula for the complete probability and Bayesian theorem. Both theorems are powerful inference tools in every chain of probabilistic relationship despite their simplicity [12].…”

Assessing Trust in Uncertain Information

“…v: assignment of all random variables to a possible value (e.g., v = {V 1 = 0, V 2 = 1}). v|X (for some X ⊆ V ): projection of v that only includes the random variables in X (e.g., v|{V 2 …”

“…In particular, we use a forward sampling approach described in [2] to estimate pr = v∈Π P r BN (V = v) (recall theorem 1 and 2). The forward sampling approach generates a set of samples v 1 , · · · , v n from BN (each sample is generated in time that is linear in the size of BN ) such that the probability pr can be estimated as…”

Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks

“…Experimental results in [14,15] show that the EPIS-BN algorithm achieves a considerable improvement over the previous state of the art algorithm, the AIS-BN [2].…”