2012
JMLR
JMLR 2012
Online Submodular Minimization
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 partial feedback settings. [abs] [ pdf ][ bib ] © JMLR 2012. (edit, beta)
🌉
Interdisciplinary Bridge
- Artificial Intelligence and Mathematics & Optimization
🐣
Hot Topic Early Bird
- submodular optimization