Conference paper
On-line variance minimization in O(n2) per trial?
Elad Hazan, Satyen Kale, et al.
COLT 2010
Conference paper
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 bandit settings.
Related
Kenneth L. Clarkson, Elad Hazan, et al.
Journal of the ACM
John Duchi, Elad Hazan, et al.
COLT 2010
Conference paper
Discriminative network models of schizophrenia
Guillermo A. Cecchi, Irina Rish, et al.
NeurIPS 2009