Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > COMPUTATIONAL LOWER BOUNDS FOR EXPERTS LEARNING:
Reports tagged with computational lower bounds for experts learning:
TR11-115 | 8th August 2011
Varun Kanade, Thomas Steinke

Learning Hurdles for Sleeping Experts

We study the online decision problem where the set of available actions varies over time, also called the sleeping experts problem. We consider the setting where the performance comparison is made with respect to the best ordering of actions in hindsight. In this paper, both the payoff function and the ... more >>>




ISSN 1433-8092 | Imprint