109 search results - page 4 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
AINA
2007
IEEE
13 years 11 months ago
2007
IEEE
— Quality of Service (QoS) of disadvantaged networks is usually considered from a purely network standpoint in existing works. Adversarial intervention in such networks is not an...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
ICASSP
2011
IEEE
12 years 8 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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...