Approximate learning of dynamic models (1999)by X. Boyen and D. Koller
Abstract:
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete traversal over a potentially very long sequence; furthermore, the data structures propagated in this procedure can be extremely large, making the whole process very demanding. In [Boyen & Koller, 1998], we describe an approximate inference algorithm for monitoring stochastic processes, and prove bounds on its approximation error. In this paper, we apply this algorithm as an approximate forward propagation step in an EM algorithm for learning temporal Bayesian networks. We also provide a related approximation for the backward step, and prove error bounds for the combined algorithm. We show that EM using our inference algorithm is much faster than EM using exact inference, with no degradation of the quality of the learned model. We then extend our analysis to the online learning task, showing a bound on the error resulting from restricting attention to a small window of observations. We present an online EM learning algorithm for dynamic systems, and show that it learns much faster than standard offline EM.
Download Information
X. Boyen and D. Koller (1999). "Approximate learning of dynamic models." Advances in Neural Information Processing Systems (NIPS) (pp. 396402).


Bibtex citation
@inproceedings{Boyen+Koller:NIPS98,
author = "X. Boyen and D. Koller",
booktitle = "Advances in Neural Information Processing Systems
(NIPS)",
title = "Approximate learning of dynamic models",
pages = "396402",
year = "1999",
}
full list
