227 search results - page 2 / 46 » Linearly Parameterized Bandits |
COLT
2008
Springer
13 years 7 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 29 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
2010
Springer
13 years 6 days ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
ICML
2001
IEEE
14 years 6 months ago
2001
IEEE
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...