Expectation maximization as message passing

Abstract

Based on prior work by Eckford, it is shown how expectation maximization (EM) may be viewed, and used, as a message passing algorithm in factor graphs.

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005

Cited by in corpus (9)

• KalmanNet: Neural Network Aided Kalman Filtering for Partially Known Dynamics
• A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
• Expectation Maximization as Message Passing - Part I: Principles and Gaussian Messages
• Active Inference and Epistemic Value in Graphical Models
• Entropy Message Passing
• A Message Passing Approach for Multiple Maneuvering Target Tracking
• Automating Model Comparison in Factor Graphs
• Joint Channel Estimation and Channel Decoding in Physical-Layer Network Coding Systems: An EM-BP Factor Graph Framework
• Belief-propagation-based joint channel estimation and decoding for spectrally efficient communication over unknown sparse channels