AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks (2000)
Cached
Download Links
- [www.cs.washington.edu]
- [www.cs.cmu.edu]
- [www.kddresearch.org]
- [www.ics.uci.edu]
- [jair.org]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Artificial Intelligence Research |
| Citations: | 60 - 4 self |
BibTeX
@ARTICLE{Cheng00ais-bn:an,
author = {Jian Cheng and Marek J. Druzdzel},
title = {AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks},
journal = {Journal of Artificial Intelligence Research},
year = {2000},
volume = {13},
pages = {13--155}
}
Years of Citing Articles
OpenURL
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 nite-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 dierent stages of the algorithm. We tested the performance of the AIS-BN algorithm along with two state of the art general purpose sampling algorithms, lik...







