74 search results - page 6 / 15 » Regret Bounds for Gaussian Process Bandit Problems |
91
Voted
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
115
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
119
Voted
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
TSP
2010
14 years 6 months ago
2010
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...