66 search results - page 3 / 14 » The Nonstochastic Multiarmed Bandit Problem |
COLT
2003
Springer
14 years 25 days ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
CORR
2011
Springer
13 years 2 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...
AGI
2011
12 years 11 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
NIPS
2008
13 years 9 months ago
2008
We formulate and study a new variant of the k-armed bandit problem, motivated by e-commerce applications. In our model, arms have (stochastic) lifetime after which they expire. In...
TSP
2010
13 years 2 months ago
2010
A restless multi-armed bandit problem that arises in multichannel opportunistic communications is considered, where channels are modeled as independent and identical Gilbert