An Improved Three-Weight Message-Passing Algorithm

Abstract

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 algorithm to implement constraint propagation as a special case, while the "no opinion" messages speed convergence for some problems by making the algorithm focus only on active constraints. We describe how our three-weight version of ADMM/DC can give greatly improved performance for non-convex problems such as circle packing and solving large Sudoku puzzles, while retaining the exact performance of ADMM for convex problems. We also describe the advantages of our algorithm compared to other message-passing algorithms based upon belief propagation.

References in corpus (1)

• Divide and concur: A general approach to constraint satisfaction

Cited by in corpus (13)

• A Distributed ADMM Approach to Non-Myopic Path Planning for Multi-Target Tracking
• How is Distributed ADMM Affected by Network Topology?
• A General System for Heuristic Solution of Convex Problems over Nonconvex Sets
• Deep learning for neuroimaging: a validation study
• A message-passing algorithm for multi-agent trajectory planning
• Fast and Effective Algorithms for Symmetric Nonnegative Matrix Factorization
• A Simple Effective Heuristic for Embedded Mixed-Integer Quadratic Programming
• Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing
• Global hard thresholding algorithms for joint sparse image representation and denoising
• Testing fine-grained parallelism for the ADMM on a factor-graph
• Bounding Duality Gap for Separable Problems with Linear Constraints
• Optimal control of linear systems with limited control actions: threshold-based event-triggered control
• Rank-Based Multi-task Learning for Fair Regression