263 search results - page 1 / 53 » Regret Bounds for Prediction Problems |
COLT
1999
Springer
13 years 8 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...
ALT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...
COLT
2004
Springer
13 years 8 months ago
2004
Springer
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...