Approximate Learning of Dynamic Models

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 [2], 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 learningtask, showing a boundon the error resulting from res...

• Type: Conference
• Year: 1998
• Where: NIPS
• Authors: Xavier Boyen, Daphne Koller
• Keywords: Approximate Inference Algorithm, EM Learning Algorithm, Inference Algorithm, NIPS 1998, NIPS 2007