Corpus ID: 3032454

An Improved Three-Weight Message-Passing Algorithm

@article{Derbinsky2013AnIT,
  title={An Improved Three-Weight Message-Passing Algorithm},
  author={Nate Derbinsky and Jos{\'e} Bento and V. Elser and J. Yedidia},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.1961}
}
We describe how the powerful "Divide and Concur" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for convex optimization, and introduce an improved message-passing algorithm based on ADMM/DC by introducing three distinct weights for messages, with "certain" and "no opinion" weights, as well as the standard weight used in ADMM/DC. The "certain" messages allow our improved… Expand
42 Citations
Proximal Algorithms
  • 2,536
  • PDF
Distributed Optimization, Averaging via ADMM, and Network Topology
  • PDF
How is Distributed ADMM Affected by Network Topology
  • 17
  • PDF
A simple effective heuristic for embedded mixed-integer quadratic programming
  • 86
  • PDF
Testing Fine-Grained Parallelism for the ADMM on a Factor-Graph
  • 11
  • PDF
ADMM decoding of error correction codes: From geometries to algorithms
  • X. Liu, S. Draper
  • Computer Science, Mathematics
  • 2015 IEEE Information Theory Workshop (ITW)
  • 2015
A general system for heuristic minimization of convex functions over non-convex sets
  • 40
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Message-Passing Algorithms for Inference and Optimization
  • 39
Understanding belief propagation and its generalizations
  • 1,502
  • PDF
Efficient belief propagation for early vision
  • 893
Divide and Concur and Difference-Map BP Decoders for LDPC Codes
  • 28
  • PDF
Constructing free-energy approximations and generalized belief propagation algorithms
  • 1,571
  • PDF
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
  • 12,265
  • Highly Influential
  • PDF
Sudoku as a Constraint Problem
  • 135
  • PDF
Codes on graphs: normal realizations
  • G. Forney
  • 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
  • 2000
  • 493
Decomposition methods for large scale LP decoding
  • 13
...
1
2
3
4
...