Decomposable Submodular Function Minimization via Maximum Flow

by   Kyriakos Axiotis, et al.

This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running times for this problem by reducing it to a number of calls to a maximum flow oracle. When each function in the decomposition acts on O(1) elements of the ground set V and is polynomially bounded, our running time is up to polylogarithmic factors equal to that of solving maximum flow in a sparse graph with O(| V |) vertices and polynomial integral capacities. We achieve this by providing a simple iterative method which can optimize to high precision any convex function defined on the submodular base polytope, provided we can efficiently minimize it on the base polytope corresponding to the cut function of a certain graph that we construct. We solve this minimization problem by lifting the solutions of a parametric cut problem, which we obtain via a new efficient combinatorial reduction to maximum flow. This reduction is of independent interest and implies some previously unknown bounds for the parametric minimum s,t-cut problem in multiple settings.



There are no comments yet.


page 1

page 2

page 3

page 4


A Note on Isolating Cut Lemma for Submodular Function Minimization

It has been observed independently by many researchers that the isolatin...

A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method

The Quickest Transshipment Problem is to route flow as quickly as possib...

Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization

We consider the problem of jointly inferring the M-best diverse labeling...

Computing exact minimum cuts without knowing the graph

We give query-efficient algorithms for the global min-cut and the s-t cu...

An FFT-based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid

We introduce an FFT-based solver for the combinatorial continuous maximu...

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization

In this paper we provide improved running times and oracle complexities ...

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components

Minimizing a sum of simple submodular functions of limited support is a ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.