Corpus ID: 18235

Efficient Minimization of Decomposable Submodular Functions

@inproceedings{Stobbe2010EfficientMO,
  title={Efficient Minimization of Decomposable Submodular Functions},
  author={P. Stobbe and Andreas Krause},
  booktitle={NIPS},
  year={2010}
}
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time. Unfortunately, state-of-the-art algorithms for general submodular minimization are intractable for larger problems. In this paper, we introduce a novel subclass of submodular minimization problems that we call decomposable. Decomposable submodular… 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
Quadratic Decomposable Submodular Function Minimization: Theory and Practice
TLDR
A new convex optimization problem, termed quadratic decomposable submodular function minimization (QDSFM), which allows to model a number of learning tasks on graphs and hypergraphs and two new applications of QDSFM are described: hypergraph-adapted PageRank and semi-supervised learning. Expand
Quadratic Decomposable Submodular Function Minimization: Theory and Practice
We introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization (QDSFM), which allows to model a number of learning tasks on graphs and hypergraphs. TheExpand
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
Size-constrained Submodular Minimization through Minimum Norm Base
TLDR
This paper discusses the submodular minimization under a size constraint, which is NP-hard, and generalizes the densest subgraph problem and the uniform graph partitioning problem and computes optimal solutions for some of possible size constraints in polynomial time. Expand
Convex Analysis for Minimizing and Learning Submodular Set Functions
The connections between convexity and submodularity are explored, for purposes of minimizing and learning submodular set functions. First, we develop a novel method for minimizing a particular classExpand
Minimizing a Submodular Function from Samples
TLDR
There is a class of submodular functions with range in [0, 1] such that, despite being PAC-learnable and minimizable in polynomial-time, no algorithm can obtain an approximation strictly better than 1/2 − o(1) using polynomially-many samples drawn from any distribution. Expand
Quadratic Decomposable Submodular Function Minimization
TLDR
This work introduces a new convex optimization problem, termed quadratic decomposable submodular function minimization, and describes an objective that may be optimized via random coordinate descent methods and projections onto cones and establishes the linear convergence rate of the RCD algorithm. Expand
Minimizing a Submodular Function from Samples
In this paper we consider the problem of minimizing a submodular function from training data. Submodular functions can be efficiently minimized and are consequently heavily applied in machineExpand
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 27 REFERENCES
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
A push-relabel framework for submodular function minimization and applications to parametric optimization
TLDR
This paper improves the running time of Schrijver's algorithm by designing a push-relabel framework for submodular function minimization (SFM), and extends this algorithm to carry out parametric minimization for a strong map sequence of sub modular functions in the same asymptotic running time as a single SFM. Expand
SFO: A Toolbox for Submodular Function Optimization
TLDR
SFO is presented, a toolbox for use in MATLAB or Octave that implements algorithms for minimization and maximization of submodular functions that allows one to efficiently find provably (near-) optimal solutions for large problems. Expand
Structured sparsity-inducing norms through submodular functions
  • F. Bach
  • Computer Science, Mathematics
  • NIPS
  • 2010
TLDR
This paper shows that for nondecreasing submodular set-functions, the corresponding convex envelope can be obtained from its Lovasz extension, a common tool in sub modular analysis, and defines a family of polyhedral norms, for which it provides generic algorithmic tools and theoretical results. Expand
The Minimum-Norm-Point Algorithm Applied to Submodular Function Minimization and Linear Programming
In the present paper we consider applications of the minimum-norm-point algorithm to submodular function minimization and linear programming. Although combinatorial polynomial algorithms forExpand
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
TLDR
This work designs FPTAS for the authors' relaxation that can be used to design approximation algorithms for the original problem for the metric case and proposes the use of simple and recent algorithms for non-smooth convex optimization due to Nesterov to approximately solve them. 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
An analysis of approximations for maximizing submodular set functions—I
TLDR
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm. Expand
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 employsExpand
Submodular functions and convexity
TLDR
In “continuous” optimization convex functions play a central role, and linear programming may be viewed as the optimization of very special (linear) objective functions over very special convex domains (polyhedra). Expand
...
1
2
3
...