Corpus ID: 27944259

Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables

@inproceedings{Boros2018QuadratizationsOS,
  title={Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables},
  author={Endre Boros and Yves Crama and Elisabeth Rodr{\'i}guez-Heck},
  booktitle={ISAIM},
  year={2018}
}
The problem of minimizing a pseudo-Boolean function with no additional constraints arises in a variety of applications. A quadratization is a quadratic reformulation of the nonlinear problem obtained by introducing a set of auxiliary binary variables which can be optimized using quadratic optimization techniques. Using the well-known result that a pseudoBoolean function can be uniquely expressed as a multilinear polynomial, any pseudo-Boolean function can be quadratized by providing a… Expand
Compact quadratizations for pseudo-Boolean functions
TLDR
Upper and lower bounds on the number of auxiliary variables required to define a quadratization for several classes of specially structured functions, such as functions with many zeros, symmetric, exact k-out-of-n, at least k- out- of-n and parity functions, and monomials with a positive coefficient are presented. Expand
All 4-variable functions can be perfectly quadratized with only 1 auxiliary variable
TLDR
It is proved that any function with real-valued coefficients is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new variable. Expand
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
The problem of optimizing a multilinear polynomial on binary variables without additional constraints arises in a variety of applications. We are interested in resolution methods based onExpand
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph
TLDR
This paper develops a new quadratization algorithm based on the idea of the constraint composite graph (CCG) that outperforms the state-of-the-art algorithms in terms of both effectiveness and efficiency on randomly generated instances and a novel reformulation of the uncapacitated facility location problem. Expand
Quadratization in discrete optimization and quantum mechanics
TLDR
This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness theorems, and also non-perturbative k-local to 2-local transformations used for quantum mechanics, quantum annealing and universal adiabatic quantum computing. Expand
A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers
TLDR
This work proposes using quantum annealing for the theory of cuts, a field of paramount importance in theoretical computer science, and proposes a method to formulate the Minimum Multicut Problem into the QUBO representation. Expand
Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches
TLDR
The importance of generating the top $K$ solutions to WCSPs in various contexts is discussed and various approaches to do so are proposed and empirically compare. Expand
Embedding quadratization gadgets on Chimera and Pegasus graphs
TLDR
All known quadratizations of cubic and quartic terms in binary optimization problems are grouped into six and seven unique graphs respectively and a minor embedding of these graphs is performed onto the well-known Chimera graph, and the brand new Pegasus graph. Expand

References

SHOWING 1-10 OF 13 REFERENCES
Quadratic reformulations of nonlinear binary optimization problems
TLDR
This paper provides tight lower and upper bounds on the number of auxiliary variables needed in the worst-case for general objective functions, for bounded-degree functions, and for a restricted class of quadratizations. Expand
Quadratization of Symmetric Pseudo-Boolean Functions
TLDR
The number of auxiliary variables required by quadratizations of symmetric pseudo-Boolean functions f ( x ) is determined, those functions whose value depends only on the Hamming weight of the input x (the number of variables equal to 1). Expand
Pseudo-Boolean optimization
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. TheExpand
Boolean Functions - Theory, Algorithms, and Applications
  • Y. Crama, P. Hammer
  • Mathematics, Computer Science
  • Encyclopedia of mathematics and its applications
  • 2011
TLDR
JBool: a software tool Claude Benzaken and Nadia Brauner, and characterizations of special classes by functional equations Lisa Hellerstein. Expand
What energy functions can be minimized via graph cuts?
  • V. Kolmogorov, R. Zabih
  • Medicine, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2004
TLDR
This work gives a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. Expand
Transformation of General Binary MRF Minimization to the First-Order Case
  • H. Ishikawa
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2011
We introduce a transformation of general higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, we formalize a framework forExpand
Energy minimization via graph cuts: settling what is possible
  • D. Freedman, Petros Drineas
  • Computer Science, Mathematics
  • 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
  • 2005
TLDR
First, the case of k-wise pixel interactions is examined; the results are derived from a purely algebraic approach; second, the applicability of provably approximate algorithms are discussed. Expand
Higher-order gradient descent by fusion-move graph cut
  • H. Ishikawa
  • Mathematics, Computer Science
  • 2009 IEEE 12th International Conference on Computer Vision
  • 2009
TLDR
This paper focuses on the efficiency of the higher-order graph cuts and presents a simple technique for generating proposal labelings that makes the algorithm much more efficient, which is empirically show using examples in stereo and image denoising. Expand
Boolean methods in operations research and related areas
What Energy Functions Can Be Minimized via Graph Cuts?
TLDR
This work gives a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. Expand
...
1
2
...