MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Tractable inference for complex stochastic processes (1998) [203 citations — 13 self]

Download:
Download as a PDF | Download as a PS
by Xavier Boyen, Daphne Koller
In Proc. UAI
http://deas.harvard.edu/courses/cs281r/Readings/bk.dbn.uai98.ps
Add To MetaCart

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. 1

Citations

4833 Elements of Information Theory – Cover, Thomas - 1991
960 Local computations with probabilities on graphical structures and their application to expert systems – Lauritzen, Spiegelhalter - 1988
894 A new approach to linear filtering and prediction problems – Kalman - 1960
589 An introduction to hidden Markov models – Rabiner, Juang - 1986
338 A model for reasoning about persistence and causation – Dean, Kanazawa - 1989
279 Factorial hidden Markov models – Ghahramani, Jordan - 1997
155 Probabilistic independence networks for hidden markov probability models – Smyth, Heckerman, et al. - 1997
143 Stochastic simulation algorithms for dynamic probabilistic networks – Kanazawa, Koller, et al. - 1995
88 Inference in belief networks: A procedural guide – Huang, Darwiche - 1996
86 Optimal control of Markov decision processes with incomplete state estimation – Astrom - 1965
82 The batmobile: Towards a bayesian automated taxi – Forbes, Huang, et al. - 1995
78 Exploiting tractable substructures in intractable networks – Saul, Jordan - 1996
59 A scheme for approximating probabilistic inference – Dechter, Rish - 1997
59 A computational scheme for reasoning in dynamic probabilistic networks – Kjaerulff - 1992
57 Dynamic network models for forecasting – Dagum, Galper, et al. - 1992
54 Using learning for approximation in stochastic processes – Koller, Fratkina - 1998
16 Tradeoffs in constructing and evaluating temporal influence diagrams – Provan - 1993
15 A computational scheme for reasoning in dynamic probabilistic networks – Kjærulff - 1992
8 An expert system for control of waste water treatment—a pilot project – Jensen, Kjærulff, et al. - 1989
7 A computational scheme for reasoning in dynamic probabilistic networks – Kjrulff - 1992