66 search results - page 10 / 14 » The Nonstochastic Multiarmed Bandit Problem |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
TSP
2012
12 years 3 months ago
2012
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
COLT
2008
Springer
13 years 9 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...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...