23 search results - page 2 / 5 » Online Optimization in X-Armed Bandits |
COLT
2010
Springer
13 years 2 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...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
CORR
2012
Springer
12 years 9 days ago
2012
Springer
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
NIPS
2008
13 years 6 months ago
2008
