Low-rank semidefinite programming for the MAX2SAT problem

  title={Low-rank semidefinite programming for the MAX2SAT problem},
  author={Po-Wei Wang and J. Zico Kolter},
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum satisfiability problems, but their application has traditionally been very limited by their speed and randomized nature. Our approach overcomes this difficult by using a recent approach to low-rank semidefinite programming, specialized to work in an… 

Figures from this paper

Efficient semidefinite-programming-based inference for binary and multi-class MRFs
An efficient method for computing the partition function or MAP estimate in a pairwise MRF by instead exploiting a recently proposed coordinate-descent-based fast semidefinite solver is proposed and substantially outperforms the existing state of the art in approximate inference.
Efficient Low Rank Convex Bounds for Pairwise Discrete Graphical Models
A Burer-Monteiro style method is extended to compute low rank Semi-Definite Programming bounds for the MAP problem on discrete graphical models with an arbitrary number of states and arbitrary pairwise potentials and it is shown that the algorithm is decreas-ing.
MatSat: a matrix-based differentiable SAT solver
It is shown that MatSat implemented on GPU can solve the problem with n = 3×10 variables, demonstrating the feasibility of hardware acceleration by GPU for matrix-based solvers like MatSat.
SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver
This paper introduces a differentiable (smoothed) maximum satisfiability (MAXSAT) solver that can be integrated into the loop of larger deep learning systems and demonstrates that by integrating this solver into end-to-end learning systems, this approach shows promise in integrating logical structures within deep learning.
An Integer Linear Programming Framework for Mining Constraints from Data
A general integer linear programming (ILP) framework for mining constraints from data, which can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules and conduct a theoretical analysis on how close the mined constraints are from the ground truth.
Efficient semidefinite bounds for multi-label discrete graphical models
More than local consistencies/convergent message passing approaches are required than local local consistency/conversation passing approaches.
Abstract Reasoning via Logic-guided Generation
Reasoning via Logic-guided Generation Sihyun Yu 1 Sangwoo Mo 1 Sungsoo Ahn 2 Jinwoo Shin 1


Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
This approach uses Lagrangian duality to obtain a “nearly optimal” solution of the basic semidefinite Max-Cut relaxation, strengthened by triangle inequalities, and could prove optimality for several problems of the literature where, to the best of the knowledge, no other method is able to do so.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
A nonlinear programming algorithm for solving semidefinite programs (SDPs) in standard form that replaces the symmetric, positive semideFinite variable X with a rectangular variable R according to the factorization X=RRT.
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
It is shown that the low-rank Burer--Monteiro formulation of SDPs in that class almost never has any spurious local optima, including applications such as max-cut, community detection in the stochastic block model, robust PCA, phase retrieval and synchronization of rotations.
The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
This work shows that with a step size, the Mixing method converges to the global optimum of the semidefinite program almost surely in a locally linear rate under random initialization, and is the first low-rank semideFinite programming method to achieve a global optimum on the spherical manifold without assumption.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
On semidefinite programming relaxations for the satisfiability problem
  • M. Anjos
  • Computer Science
    Math. Methods Oper. Res.
  • 2004
A comparison of the relative practical performances of the SDP relaxations shows that, among these three relaxations, the new relaxation provides the best tradeoff between theoretical strength and practical performance within an enumerative algorithm.
Sums of squares based approximation algorithms for MAX-SAT
The Power of Semidefinite Programming Relaxations for MAX-SAT
Semidefinite Programming (SDP) based relaxations are surprisingly powerful, providing much tighter bounds than LP relaxations, across different constrainedness regions, and this shows the effectiveness of SDP relaxations in providing heuristic guidance for iterative variable setting, significantly more accurate than the guidance based on LP relaxation.
SAT-based MaxSAT algorithms
SDP-based Max-2-Sat Decomposition
The methods investigated were able to approach the lower bounds of SDP within 2% but do not provide performance guarantees and cannot compete with conventional local search methods.