Message quantization in belief propagation: Structural results in the low-rate regime
Name
Kreidl-2009-Message quantization in belief propagation Structural results in the low-rate regime.pdf
Size
273.33 KB
Format
Adobe PDF
Checksum (MD5)
dd777a6ab03cb5276e145fa7da760c0b
Author(s)
Willsky, Alan S.
Kreidl, Olivier Patrick
Date Issued
January 2010
Journal
47th Annual Allerton Conference on Communication, Control, and Computing, 2009. Allerton 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Kreidl, O.P., and A.S. Willsky. “Message quantization in belief propagation: Structural results in the low-rate regime.” Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on. 2009. 431-438. © 2010 Institute of Electrical and Electronics Engineers.
Version
Final published version
Abstract
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-dependent and iteration-dependent, each rule making explicit use of local memory from all past iterations. These results expose both the intractability of optimal design and an inherent structure that can be exploited for tractable approximate design. We propose one such approximation and demonstrate its efficacy on canonical examples. We also discuss extensions to communication networks with lossy links (e.g., erasures) or topologies that differ from the graph underlying the probabilistic model.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2009.5394797
