Minimizing a sum of submodular functions

@article{Kolmogorov2012MinimizingAS,
  title={Minimizing a sum of submodular functions},
  author={V. Kolmogorov},
  journal={Discret. Appl. Math.},
  year={2012},
  volume={160},
  pages={2246-2258}
}
  • V. Kolmogorov
  • Published 2012
  • Computer Science, Mathematics
  • Discret. Appl. Math.
We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinality-dependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized exchange capacity subroutines for individual terms. To overcome this, we cast the problem as a submodular… Expand
Decomposable Submodular Function Minimization via Maximum Flow
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running timesExpand
Active-set Methods for Submodular Minimization Problems
TLDR
A new active-set algorithm for total variation denoising with the assumption of an oracle that solves the corresponding SFM problem is proposed, which performs local descent over ordered partitions and its ability to warm start considerably improves the performance of the algorithm. Expand
Fast Decomposable Submodular Function Minimization using Constrained Total Variation
TLDR
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. Expand
Submodular functions: from discrete to continuous domains
  • F. Bach
  • Computer Science, Mathematics
  • Math. Program.
  • 2019
TLDR
This paper shows that most results relating submodularity and convexity for set-functions can be extended to all submodular functions, and provides practical algorithms which are based on function evaluations, to minimize generic sub modular functions on discrete domains, with associated convergence rates. Expand
On the Convergence Rate of Decomposable Submodular Function Minimization
TLDR
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. Expand
Non-expressibility of Submodular Languages
TLDR
A negative answer to this question is shown: there are submodular functions that cannot be reduced to the minimum cut problem via the expressibility reduction. Expand
Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions
TLDR
Novel mapping is defined that transform submodular functions of order $k$ into quadratic ones, which can be efficiently minimized in $O(n^3)$ time using a max-flow algorithm. Expand
Distributed Submodular Minimization via Block-Wise Updates and Communications
TLDR
A distributed algorithm is proposed in which agents resort to the Lov\`{a}sz extension of their local submodular functions and perform local updates and communications in terms of single blocks of the entire optimization variable, resulting in a reduced computational burden. Expand
Learning with Submodular Functions: A Convex Optimization Perspective
  • F. Bach
  • Computer Science, Mathematics
  • Found. Trends Mach. Learn.
  • 2013
TLDR
In Learning with Submodular Functions: A Convex Optimization Perspective, the theory of submodular functions is presented in a self-contained way from a convex analysis perspective, presenting tight links between certain polyhedra, combinatorial optimization and convex optimization problems. Expand
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions
TLDR
This paper uses random coordinate descent methods to obtain algorithms with faster linear convergence rates and cheaper iteration costs, and their algorithms converge in significantly fewer iterations. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Minimizing a Submodular Function Arising From a Concave Function
TLDR
As an application of the parametric approach, this work improves the time complexity of a capacity scaling algorithm for the submodular flow problem and discusses a generalization and its relation to the principal partition or the lexicographically optimal base of a sub modular system. Expand
Efficient Minimization of Decomposable Submodular Functions
TLDR
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. Expand
Minimizing symmetric submodular functions
We describe a purely combinatorial algorithm which, given a submodular set functionf on a finite setV, finds a nontrivial subsetA ofV minimizingf[A] + f[V ∖ A]. This algorithm, an extension of theExpand
A simple combinatorial algorithm for submodular function minimization
TLDR
This is the first fully combinatorial submodular function minimization algorithm that does not rely on the scaling method and can be implemented in strongly polynomial time using only additions, subtractions, comparisons, and the oracle calls for function evaluation. Expand
New algorithms for the intersection problem of submodular systems
We consider the problem of finding a maximum common subbase of two submodular systems onE with |E|=n. First, we present a new algorithm by finding the shortest augmenting paths, which begins with aExpand
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
TLDR
It is proved that every valued constraint satisfaction problem with submodular cost functions has an equivalent instance on the same constraint scopes in which the actual minimum value of the objective function is rendered explicit. Expand
A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗
Combinatorial strongly polynomial algorithms for minimizing submodular functions have been developed by Iwata, Fleischer, and Fujishige (IFF) and by Schrijver. The IFF algorithm employs a scalingExpand
A faster strongly polynomial time algorithm for submodular function minimization
  • J. Orlin
  • Mathematics, Computer Science
  • Math. Program.
  • 2009
TLDR
A combinatorial algorithm that runs in O(n5EO  +  n6) time, where EO is the time to evaluate f(S) for some submodular function f defined on a set V with n elements is given. Expand
Classes of submodular constraints expressible by graph cuts
TLDR
Several broad classes of submodular constraints over a Boolean domain are identified which can be minimised in cubic time, and how these results translate to certain optimisation problems arising in computer vision is described. Expand
The expressive power of binary submodular functions
TLDR
The 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. Expand
...
1
2
3
4
...