74 search results - page 7 / 15 » Regret Bounds for Gaussian Process Bandit Problems |
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
COLT
2004
Springer
15 years 2 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...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
COLT
2004
Springer
15 years 1 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
SIAMCOMP
2002
14 years 9 months ago
2002
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...