6 search results - page 1 / 2 » Tuning Bandit Algorithms in Stochastic Environments |
ALT
2007
Springer
14 years 1 months ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
EVOW
2012
Springer
12 years 15 days ago
2012
Springer
We are using bandit-based adaptive operator selection while autotuning parallel computer programs. The autotuning, which uses evolutionary algorithm-based stochastic sampling, take...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
COLT
2010
Springer
13 years 2 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...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...