Convex Analysis and Optimization with Submodular Functions: a Tutorial

10/20/2010
by   Francis Bach, et al.
0

Set-functions appear in many areas of computer science and applied mathematics, such as machine learning, computer vision, operations research or electrical networks. Among these set-functions, submodular functions play an important role, similar to convex functions on vector spaces. In this tutorial, the theory of submodular functions is presented, in a self-contained way, with all results shown from first principles. A good knowledge of convex analysis is assumed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2008

The Expressive Power of Binary Submodular Functions

It has previously been an open problem whether all Boolean submodular fu...
research
07/11/2019

Quantum and Classical Algorithms for Approximate Submodular Function Minimization

Submodular functions are set functions mapping every subset of some grou...
research
11/13/2018

Approximating minimum representations of key Horn functions

Horn functions form a subclass of Boolean functions and appear in many d...
research
12/06/2013

An Algorithmic Theory of Dependent Regularizers, Part 1: Submodular Structure

We present an exploration of the rich theoretical connections between se...
research
12/07/2010

Shaping Level Sets with Submodular Functions

We consider a class of sparsity-inducing regularization terms based on s...
research
11/23/2020

Functions that Preserve Manhattan Distances

What functions, when applied to the pairwise Manhattan distances between...
research
10/07/2013

Potts model, parametric maxflow and k-submodular functions

The problem of minimizing the Potts energy function frequently occurs in...

Please sign up or login with your details

Forgot password? Click here to reset