Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages

Details Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages

2009-10-15

arxiv.org/abs/0910.2832v1

Computer Science

Information Theory

Scientific paper

It is shown how expectation maximization (EM) may be viewed as a message passing algorithm in factor graphs. In particular, a general EM message computation rule is identified. As a factor graph tool, EM may be used to break cycles in a factor graph, and tractable messages may in some cases be obtained where the sum-product messages are unwieldy. As an exemplary application, the paper considers linear Gaussian state space models. Unknown coefficients in such models give rise to multipliers in the corresponding factor graph. A main attraction of EM in such cases is that it results in purely Gaussian message passing algorithms. These Gaussian EM messages are tabulated for several (scalar, vector, matrix) multipliers that frequently appear in applications.

Affiliated with

Also associated with

No associations

Rating

Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619619