Online Submodular Minimization
Elad Hazan, Satyen Kale; 13(93):2903−2922, 2012.
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) |