263 search results - page 6 / 53 » Regret Bounds for Prediction Problems |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
ML
2002
ACM
13 years 7 months ago
2002
ACM
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In the framework of prediction with expert advice, we consider a recently introduced kind of regret bounds: the bounds that depend on the effective instead of nominal number of ex...
NIPS
2008
13 years 8 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...