CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
126
click to vote
COLT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
ALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...