13 search results - page 2 / 3 » On the Combinatorial Multi-Armed Bandit Problem with Markovi... |
COLT
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
CORR
2010
Springer
13 years 3 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...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
Abstract—We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. At each time, a player chooses K out of N (N > K) arms to play. The state of each ar...