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. © 2012 Elad Hazan and Satyen Kale.
Author supplied keywords
Cite
CITATION STYLE
APA
Hazan, E., & Kale, S. (2012). Online submodular minimization. Journal of Machine Learning Research, 13, 2903–2922.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free