ML Anthology

Beyond Convexity: Online Submodular Minimization

Elad Hazan, Satyen Kale
NeurIPS 2009 pp. 700-708
/neurips/2009/hazan2009neurips-beyond/

Abstract

We consider an online decision problem over a discrete space in which the loss function is submodular. We give algorithms which are computationally efficient and are Hannan-consistent in both the full information and bandit settings.

PDF NeurIPS Semantic Scholar

Cite

Text

Hazan and Kale. "Beyond Convexity: Online Submodular Minimization." Neural Information Processing Systems, 2009.

Markdown

[Hazan and Kale. "Beyond Convexity: Online Submodular Minimization." Neural Information Processing Systems, 2009.](https://mlanthology.org/neurips/2009/hazan2009neurips-beyond/)

BibTeX

@inproceedings{hazan2009neurips-beyond,
  title     = {{Beyond Convexity: Online Submodular Minimization}},
  author    = {Hazan, Elad and Kale, Satyen},
  booktitle = {Neural Information Processing Systems},
  year      = {2009},
  pages     = {700-708},
  url       = {https://mlanthology.org/neurips/2009/hazan2009neurips-beyond/}
}