66 search results - page 5 / 14 » The Nonstochastic Multiarmed Bandit Problem |
ML
2002
ACM
13 years 7 months ago
2002
ACM
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
COLT
2004
Springer
13 years 11 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
ALT
2011
Springer
12 years 7 months ago
2011
Springer
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...