97 search results - page 2 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
COLT
2010
Springer
13 years 3 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...