Log In Sign Up

State-space Abstraction for Anytime Evaluation of Probabilistic Networks

by   Michael P. Wellman, et al.

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.


page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8


Sound Abstraction of Probabilistic Actions in The Constraint Mass Assignment Framework

This paper provides a formal and practical framework for sound abstracti...

Probabilistic Adaptive Computation Time

We present a probabilistic model with discrete latent variables that con...

STAMINA: STochastic Approximate Model-checker for INfinite-state Analysis

Stochastic model checking is a technique for analyzing systems that poss...

State-Space Abstractions for Probabilistic Inference: A Systematic Review

Tasks such as social network analysis, human behavior recognition, or mo...

Dynamic exploration of multi-agent systems with timed periodic tasks

We formalise and study multi-agent timed models MAPTs (Multi-Agent with ...

Computational Complexity Reduction for BN2O Networks Using Similarity of States

Although probabilistic inference in a general Bayesian belief network is...

Sequential importance sampling for multi-resolution Kingman-Tajima coalescent counting

Statistical inference of evolutionary parameters from molecular sequence...