Institute Homepage DE Sign In

Back

Empirical Inference Conference Paper 2010

Online algorithms for submodular minimization with combinatorial constraints

no image
Empirical Inference
Stefanie Jegelka
no image
Empirical Inference
Jeff Bilmes

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.

Author(s): Jegelka, S. and Bilmes, J.
Pages: 1-6
Year: 2010
Month: December
Day: 0
Bibtex Type: Conference Paper (inproceedings)
Event Name: NIPS 2010 Workshop on Discrete Optimization in Machine Learning: Structures, Algorithms and Applications (DISCML)
Event Place: Whistler, BC, Canada
Digital: 0
Electronic Archiving: grant_archive
Links:

BibTex 

@inproceedings{JegelkaB2010,
  title = {Online algorithms for submodular minimization with combinatorial constraints},
  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.},
  pages = {1-6},
  month = dec,
  year = {2010},
  slug = {jegelkab2010},
  author = {Jegelka, S. and Bilmes, J.},
  month_numeric = {12}
}