# The Expressive Power of Binary Submodular Functions

It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different contexts in computer science, including computer vision, artificial intelligence, and pseudo-Boolean optimisation. Using a connection between the expressive power of valued constraints and certain algebraic properties of functions, we answer this question negatively. Our results have several corollaries. First, we characterise precisely which submodular functions of arity 4 can be expressed by binary submodular functions. Next, we identify a novel class of submodular functions of arbitrary arities which can be expressed by binary submodular functions, and therefore minimised efficiently using a so-called expressibility reduction to the Min-Cut problem. More importantly, our results imply limitations on this kind of reduction and establish for the first time that it cannot be used in general to minimise arbitrary submodular functions. Finally, we refute a conjecture of Promislow and Young on the structure of the extreme rays of the cone of Boolean submodular functions.

• 37 publications
• 7 publications
• 3 publications
research
09/11/2011

### Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions

Submodular function minimization is a key problem in a wide variety of a...
research
10/20/2010

### Convex Analysis and Optimization with Submodular Functions: a Tutorial

Set-functions appear in many areas of computer science and applied mathe...
research
05/31/2019

### Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions

We consider the problem of minimising functions represented as a differe...
research
06/27/2016

### A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns

A function f: Z_+^E →R_+ is DR-submodular if it satisfies f( + χ_i) -f (...
research
09/28/2013

### Structured learning of sum-of-submodular higher order energy functions

Submodular functions can be exactly minimized in polynomial time, and th...
research
05/09/2018

### On the Construction of Substitutes

Gross substitutability is a central concept in Economics and is connecte...
research
03/16/2022

### The Structured Abstain Problem and the Lovász Hinge

The Lovász hinge is a convex surrogate recently proposed for structured ...