English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Online algorithms for submodular minimization with combinatorial constraints

MPS-Authors
/persons/resource/persons83994

Jegelka,  S
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

http://www.discml.cc/
(Table of contents)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

NIPS-Workshop-2010-Jegelka.pdf
(Any fulltext), 149KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Jegelka, S., & Bilmes, J. (2010). Online algorithms for submodular minimization with combinatorial constraints. In NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML) (pp. 1-6).


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-BD38-F
Abstract
Building on recent results for submodular minimization with combinatorial constraints, 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.