• Corpus ID: 232134951

Decomposable Submodular Function Minimization via Maximum Flow

  title={Decomposable Submodular Function Minimization via Maximum Flow},
  author={Kyriakos Axiotis and Adam Karczmarz and A. Mukherjee and Piotr Sankowski and Adrian Vladu},
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… 

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components

This work develops the first approximation algorithms for this problem, where the approximations can be quickly computed via reduction to a sparse graph cut problem, with graph sparsity controlled by the desired approximation factor.

Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity

This work gives an algorithm that minimizes the above convex formulation to ǫ -accuracy in e O ( P ni =1 d i log(1 /ǫ )) gradient computations, with no assumptions on the condition number.

Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization

A new framework of sparsifying hypergraph-to-graph reductions is introduced, where a hypergraph cut defined by submodular cardinality-based splitting functions is (1+ε)-approximated by a cut on a directed graph.

Sparsification of Decomposable Submodular Functions

This work introduces the notion of sparsification for decomposable sub modular functions whose objective is to obtain an accurate approximation of the original function that is a (weighted) sum of only a few submodular functions.



Efficient Minimization of Decomposable Submodular Functions

This paper develops an algorithm, SLG, that can efficiently minimize decomposable submodular functions with tens of thousands of variables, and applies it to synthetic benchmarks and a joint classification-and-segmentation task, and shows that it outperforms the state-of-the-art general purpose sub modular minimization algorithms by several orders of magnitude.

Minimizing a sum of submodular functions

  • V. Kolmogorov
  • Mathematics, Computer Science
    Discret. Appl. Math.
  • 2012

Fast Decomposable Submodular Function Minimization using Constrained Total Variation

A modified convex problem requiring constrained version of the total variation oracles that can be solved with significantly fewer calls to the simple minimization oracles is considered.

A fast algorithm for the generalized parametric minimum cut problem and applications

This paper shows how to remove both of these assumptions while obtaining the same running times as in Galloet al.

On the Convergence Rate of Decomposable Submodular Function Minimization

It is shown that the algorithm converges linearly, and the upper and lower bounds on the rate of convergence are provided, which relies on the geometry of submodular polyhedra and draws on results from spectral graph theory.

A push-relabel framework for submodular function minimization and applications to parametric optimization

On the Approximation of Submodular Functions

A large number of prior works imply that monotone submodular functions can be approximated by coverage functions with a factor between $O(\sqrt{n} \log n)$ and $\Omega(n^{1/3} /\log^2 n) $ and this work proves both upper and lower bounds on such approximations.

A combinatorial strongly polynomial algorithm for minimizing submodular functions

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employs

Geometric Rescaling Algorithms for Submodular Function Minimization

A new class of polynomial-time algorithms for submodular function minimization (SFM) as well as a unified framework to obtain stronglyPolynomial SFM algorithms that can be applied to a wide range of combinatorial and continuous algorithms, including pseudo-polynomial ones.

Subquadratic submodular function minimization

For integer-valued submodular functions, this paper gives an SFM algorithm which runs in O(nM3logn· EO) time giving the first nearly linear time algorithm in any known regime.