Online submodular minimization
Elad Hazan, Satyen Kale · 2009
We consider an online decision problem over a discrete space in which the loss function is submod-ular. We give algorithms which are computationally efficient and are Hannan-consistent in both the full information and partial feedback settings.