Timezone: »

Beyond Convexity: Online Submodular Minimization
Elad Hazan · Satyen Kale

Mon Dec 07 07:00 PM -- 11:59 PM (PST) @

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.

Author Information

Elad Hazan (Princeton University and Google Brain)
Satyen Kale (Google)

More from the Same Authors