The Factored Frontier Algorithm for Approximate Inference in DBNs

Abstract

The Factored Frontier (FF) algorithm is a simple approximate inferencealgorithm for Dynamic Bayesian Networks (DBNs). It is very similar tothe fully factorized version of the Boyen-Koller (BK) algorithm, butinstead of doing an exact update at every step followed bymarginalisation (projection), it always works with factoreddistributions. Hence it can be applied to models for which the exactupdate step is intractable. We show that FF is equivalent to (oneiteration of) loopy belief propagation (LBP) on the original DBN, andthat BK is equivalent (to one iteration of) LBP on a DBN where wecluster some of the nodes. We then show empirically that byiterating, LBP can improve on the accuracy of both FF and BK. Wecompare these algorithms on two real-world DBNs: the first is a modelof a water treatment plant, and the second is a coupled HMM, used tomodel freeway traffic.

Appears in Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI2001)

References in corpus (2)

• Loopy Belief Propagation for Approximate Inference: An Empirical Study
• Tractable Inference for Complex Stochastic Processes

Cited by in corpus (12)

• Counting Belief Propagation
• Factored Particles for Scalable Monitoring
• Planning with Noisy Probabilistic Relational Rules
• Reasoning about Hypothetical Agent Behaviours and their Parameters
• Exploiting Causality for Selective Belief Filtering in Dynamic Bayesian Networks
• Efficient inference in persistent Dynamic Bayesian Networks
• Asynchronous Dynamic Bayesian Networks
• Exploiting Agent and Type Independence in Collaborative Graphical Bayesian Games
• Factored Probabilistic Belief Tracking
• Scaling POMDPs For Selecting Sellers in E-markets-Extended Version
• Answering Hindsight Queries with Lifted Dynamic Junction Trees
• Exploiting Causality for Selective Belief Filtering in Dynamic Bayesian Networks (Extended Abstract)