263 search results - page 10 / 53 » Regret Bounds for Prediction Problems |
PODC
2009
ACM
14 years 10 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we consider online prediction from expert advice in a situation where each expert observes its own loss at each time while the loss cannot be disclosed to others fo...