Tractable Inference for Complex Stochastic Processes

Abstract

The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system, these tasks typically involve the use of a belief state- a probability distribution over the state of the process at a given point in time. Unfortunately, the state spaces of complex processes are very large, making an explicit representation of a belief state intractable. Even in dynamic Bayesian networks (DBNs), where the process itself can be represented compactly, the representation of the belief state is intractable. We investigate the idea of maintaining a compact approximation to the true belief state, and analyze the conditions under which the errors due to the approximations taken over the lifetime of the process do not accumulate to make our answers completely irrelevant. We show that the error in a belief state contracts exponentially as the process evolves. Thus, even with multiple approximations, the error in our process remains bounded indefinitely. We show how the additional structure of a DBN can be used to design our approximation scheme, improving its performance significantly. We demonstrate the applicability of our ideas in the context of a monitoring task, showing that orders of magnitude faster inference can be achieved with only a small degradation in accuracy.

Appears in Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI1998)

References in corpus (1)

• A Scheme for Approximating Probabilistic Inference

Cited by in corpus (21)

• Expectation Propagation for approximate Bayesian inference
• Learning the Structure of Dynamic Probabilistic Networks
• Value-Function Approximations for Partially Observable Markov Decision Processes
• Continuous Time Bayesian Networks
• Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
• Probabilistic State-Dependent Grammars for Plan Recognition
• The Factored Frontier Algorithm for Approximate Inference in DBNs
• Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms
• Approximate Planning for Factored POMDPs using Belief State Simplification
• Factored Particles for Scalable Monitoring
• Value-Directed Belief State Approximation for POMDPs
• Sufficiency, Separability and Temporal Probabilistic Models
• Discovering the Hidden Structure of Complex Dynamic Systems
• Vector-space Analysis of Belief-state Approximation for POMDPs
• Monte-Carlo optimizations for resource allocation problems in stochastic network systems
• Expectation Propogation for approximate inference in dynamic Bayesian networks
• Efficient inference in persistent Dynamic Bayesian Networks
• Asynchronous Dynamic Bayesian Networks
• Variational Learning in Mixed-State Dynamic Graphical Models
• Approximate Separability for Weak Interaction in Dynamic Systems
• Particle Filters in Robotics (Invited Talk)