Michael Wellman, Chao-Lin Liu

Proceedings of the Proceedings of the Tenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-94), 567-57, 1994.

Abstract

One important factor determining the computational complexity of evaluating a probabilistic network is the cardinality of the state spaces of the nodes. By varying the granularity of the state spaces, one can trade off accuracy in the result for computational efficiency. We present an anytime procedure for approximate evaluation of probabilistic networks based on this idea. On application to some simple networks, the procedure exhibits a smooth improvement in approximation quality as computation time increases. This suggests that state-space abstraction is one more useful control parameter for designing real-time probabilistic reasoners.