Message quantization in belief propagation: Structural results in the low-rate regime
Motivated by distributed inference applications in unreliable communication networks, we adapt the popular (sum-product) belief propagation (BP) algorithm under the constraint of discrete-valued messages. We show that, in contrast to conventional BP, the optimal message-generation rules are node-dep...
Main Authors: | Willsky, Alan S. (Contributor), Kreidl, Olivier Patrick (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2010-10-22T18:16:05Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
An Efficient Message-Passing Algorithm for Optimizing Decentralized Detection Networks
by: Kreidl, Olivier Patrick, et al.
Published: (2012) -
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
by: Sanghavi, S., et al.
Published: (2013) -
Belief propagation with quantum messages for quantum-enhanced classical communications
by: Narayanan Rengaswamy, et al.
Published: (2021-06-01) -
Graphical models and message-passing algorithms for network-constrained decision problems
by: Kreidl, O. Patrick
Published: (2009) -
Message Passing for Maximum Weight Independent Set
by: Sanghavi, Sujay, et al.
Published: (2011)