7 search results - page 2 / 2 » Online Learning in Adversarial Lipschitz Environments |
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
COLT
2008
Springer
13 years 7 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...