• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Tractable inference for complex stochastic processes (1998)

Cached

  • Download as a PDF

Download Links

  • [ai.stanford.edu]
  • [www.eecs.harvard.edu]
  • [robotics.stanford.edu]
  • [www.eecs.harvard.edu]
  • [deas.harvard.edu]
  • [robotics.stanford.edu]
  • [robotics.stanford.edu]
  • [www.cis.upenn.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Xavier Boyen
Venue:In Proc. UAI
Citations:228 - 11 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Boyen98tractableinference,
    author = {Xavier Boyen},
    title = {Tractable inference for complex stochastic processes},
    booktitle = {In Proc. UAI},
    year = {1998},
    pages = {33--42}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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

6514 Elements of Information Theory - Cover, Thomas - 1991
1446 A new approach to linear filtering and prediction problems - Kalman - 1960
1081 Local Computations with Probabilities on graphical structures and their applications to expert systems (with discussion - Lauritzen, Spiegelhalter
666 An introduction to hidden Markov models - Rabiner, Juang - 1986
396 A model for reasoning about persistence and causation - Dean, Kanazawa - 1990
375 Factorial hidden markov models - Ghahramani, Jordan - 1997
154 Probabilistic independence networks for hidden markov probability models - Smyth - 1997
137 Stochastic simulation algorithms for dynamic probabilistic networks - Kanazawa, Koller, et al. - 1995
119 Inference in belief networks: A procedural guide - Huang, Darwiche - 1996
99 Optimal control of Markov decision processes with incomplete state estimation - Astrom - 1965
87 The BATmobile: towards a bayesian automated taxi - Forbes, Huang, et al. - 1995
83 Exploiting tractable substructures in intractable networks - Saul, Jordan - 1996
56 Dynamic network models for forecasting - Dagum, Galper, et al. - 1992
56 A scheme for approximating probabilistic inference - Dechter, Rish - 1997
54 A computational scheme for reasoning in dynamic probabilistic networks - Kjaerulff - 1992
52 Using learning for approximation in stochastic processes - Koller, Fratkina - 1998
17 Tradeoffs in constructing and evaluating temporal influence diagrams - Provan - 1993
15 A computational scheme for reasoning in dynamic probabilistic networks - Kjærulff - 1993
8 An expert system for control of waste water treatment—a pilot project - Jensen, Kjærulff, et al. - 1989
6 A computational scheme for reasoning in dynamic probabilistic networks - Kjrulff - 1992
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University