66 search results - page 2 / 14 » The Nonstochastic Multiarmed Bandit Problem |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
SDM
2007
SIAM
13 years 7 months ago
2007
SIAM
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
We provide a framework to exploit dependencies among arms in multi-armed bandit problems, when the dependencies are in the form of a generative model on clusters of arms. We find ...
NIPS
2004
13 years 7 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...