Published 2003
| public
Book Section - Chapter
Belief Propagation on Partially Ordered Sets
- Creators
- McEliece, Robert J.
- Yildirim, Muhammed
- Others:
- Rosenthal, Joachim
- Gilliam, David S.
Chicago
Abstract
In this paper, which is based on the important recent work of Yedidia, Freeman, and Weiss, we present a generalized form of belief propagation, viz. belief propagation on a partially ordered set (PBP). PBP is an iterative message-passing algorithm for solving, either exactly or approximately, the marginalized product density problem, which is a general computational problem of wide applicability. We will show that PBP can be thought of as an algorithm for minimizing a certain "free energy" function, and by exploiting this interpretation, we will exhibit a one-to-one correspondence between the fixed points of PBP and the stationary points of the free energy.
Additional Information
© 2003 Springer-Verlag New York, Inc. This research was supported by NSF grant no. CCR-0118670, and grants from Sony, Qualcomm, and Caltech's Lee Center for Advanced Networking.Additional details
- Eprint ID
- 101117
- DOI
- 10.1007/978-0-387-21696-6_10
- Resolver ID
- CaltechAUTHORS:20200204-144202684
- NSF
- CCR-0118670
- Sony Corporation
- Qualcomm Inc.
- Caltech Lee Center for Advanced Networking
- Created
-
2020-02-04Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field
- Series Name
- IMA Volumes in Mathematics and its Applications
- Series Volume or Issue Number
- 134