PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Online algorithms for submodular minimization with combinatorial constraints
Stefanie Jegelka and Jeff Bilmes
In: DISCML, 11 Dec 2011.

Abstract

Building on recent results for submodular minimization with combinatorial con- straints, and on online submodular minimization, we address online approximation algorithms for submodular minimization with combinatorial constraints. We discuss two types of algorithms and outline approximation algorithms that integrate into those.

EPrint Type:Conference or Workshop Item (Talk)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:7942
Deposited By:Stefanie Jegelka
Deposited On:17 March 2011