23 search results - page 3 / 5 » Online Optimization in X-Armed Bandits |
188
click to vote
NIPS
2004
15 years 8 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
186
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
212
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
158
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
198
click to vote
LION
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...